Title :
Sufficient conditions of equivalence subgraphs by solving decomposition problems
Author :
Tkachenko, Sergey ; Solomko, I.
Author_Institution :
CAD Dept., Lviv Polytech. Nat. Univ., Lviv, Ukraine
Abstract :
Decomposition problems on the graph´s models and sufficient conditions for equivalence of the subgraphs, which are obtained by using of method of optimal reduction, are examined. The necessary lemmas and theorems, which are the theoretical basis of earlier results, were shown.
Keywords :
graph theory; decomposition problem; equivalence subgraph; necessary lemma; necessary theorem; optimal reduction method; sufficient condition; Algorithm design and analysis; Binary trees; Design automation; Educational institutions; Electronic mail; Solid modeling; Sufficient conditions; decomposition problems; equivalence; graphs; isomorphism;
Conference_Titel :
Experience of Designing and Application of CAD Systems in Microelectronics (CADSM), 2013 12th International Conference on the
Conference_Location :
Polyana Svalyava
Print_ISBN :
978-1-4673-6461-4
