A reformulation of matrix graph grammars with Boolean complexes.
Introduction to Graded Geometry, Batalin-Vilkovisky Formalism and their Applications
These notes are intended to provide a self-contained introduction to the basic ideas of finite dimensional Batalin-Vilkovisky (BV) formalism and its applications. A brief exposition of super- and graded geometries is also given. The BV–formalism is introduced through an odd Fourier transform and the algebraic aspects of integration theory are stressed. As a main application we consider the perturbation theory for certain finite dimensional integrals within BV-formalism. As an illustration we present...
O studentském semináři z teorie grafů na Matematicko-fyzikální fakultě KU
Rovinné grafy [Book]
The Orderly Colored Longest Path Problem – a survey of applications and new algorithms
A concept of an Orderly Colored Longest Path (OCLP) refers to the problem of finding the longest path in a graph whose edges are colored with a given number of colors, under the constraint that the path follows a predefined order of colors. The problem has not been widely studied in the previous literature, especially for more than two colors in the color arrangement sequence. The recent and relevant application of OCLP is related to the interpretation of Nuclear Magnetic Resonance experiments for...