×

zbMATH — the first resource for mathematics

Applicability of edge replacements in a class of combinatorial problems on graphs. (English. Russian original) Zbl 0842.05084
Russ. Acad. Sci., Dokl., Math. 50, No. 1, 23-27 (1995); translation from Dokl. Akad. Nauk, Ross. Akad. Nauk 337, No. 2, 151-153 (1994).
The use of graph-theoretic structures and methods of combinatorial character seems very promising for modelling the complex space-time structures to which a set of modern scientific and practical problems reduce. Below we consider a class of combinatorial problems on graphs to which, as a rule, classical methods and algorithms are inapplicable, and we present a computational scheme of edge replacements for their solution.

MSC:
05C85 Graph algorithms (graph-theoretic aspects)
68R10 Graph theory (including graph drawing) in computer science
PDF BibTeX XML Cite