Browsing Division of Electrical, Electronics, and Computer Science (EECS) by Subject "Hamiltonian Cycle"
Now showing items 1-2 of 2
-
Algorithms and characterizations for subclasses of planar perfect graphs
In this thesis, we consider two major subclasses of planar perfect graphs. We exploit certain decomposability and ordering properties to develop new characterizations and efficient algorithms. We study the Hamiltonian cycle ... -
Algorithms for testing planarity of chordal graphs and hamiltonicity of planar chordal graphs.
Design and analysis of graph algorithms is an active research area in Computer Science. Designing efficient algorithms for graph problems is both challenging and rewarding from the point of view of theory and applications. ...