ISSN 2224-087X (Print)
ISSN 2224-0888 (Online)

Collected scientific papers
"Electronics and information technologies"

(In 1966-2010 published under the title "Electrical engineering")

(Certificate of State Registration 17618-6468 from February 11, 2011)

Main page Search Editorial Policies Rules for Authors

Issue 60

Issue 60, Pages: 12-20
DOI: https://doi.org/
Graphs decomposition algorithm by means of its carcass
T. Grishanovich
This study is devoted to the problems of decomposition (’partition’ or ’coloring’) of graphs. We describe a technique for partitioning by means of the graph’s carcass, along with the corresponding algorithm. Besides, an example of work of this algorithm is described in a more detail for the case of non-oriented unloaded graphs. We also give an example of program realization of the above algorithm using a specific programming language. Basic problems that appear when constructing normal trees of the graphs are described
PDF Version

Main page Search Editorial Policies Rules for Authors

© Ivan Franko National University of Lviv, 2011

Developed and supported - Laboratory of high performance computing systems