Sciweavers

Share
DAM
1999

Graph Classes Between Parity and Distance-hereditary Graphs

8 years 10 months ago
Graph Classes Between Parity and Distance-hereditary Graphs
Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphism problem), which can be solved in polynomial time for distance-hereditary graphs, are NP-complete or open for parity graphs. Moreover, the metric characterizations of these two graph classes suggest an excessive gap between them. We introduce a family of classes forming an infinite lattice with respect to inclusion, whose bottom and top elements are the class of the distance-hereditary graphs and the class of the parity graphs, respectively. We propose this family as a reference framework for studying the computational complexity of fundamental graph problems. To this purpose we characterize these classes using Cunningham decomposition and then use the devised structural characterization in order to show efficient algorithms for the recognition and isomorphism problems. As far as the isomorphism graph problem is concerned we find efficient algorithms for an infinite number of different c...
Serafino Cicerone, Gabriele Di Stefano
Added 22 Dec 2010
Updated 22 Dec 2010
Type Journal
Year 1999
Where DAM
Authors Serafino Cicerone, Gabriele Di Stefano
Comments (0)
books