Sciweavers

WG
2004
Springer
13 years 9 months ago
Recognizing HHD-free and Welsh-Powell Opposition Graphs
In this paper, we consider the recognition problem on two classes of perfectly orderable graphs, namely, the HHD-free and the Welsh-Powell opposition graphs (or WPO-graphs). In par...
Stavros D. Nikolopoulos, Leonidas Palios
WG
2005
Springer
13 years 9 months ago
Recognizing HHDS-Free Graphs
In this paper, we consider the recognition problem on the HHDS-free graphs, a class of homogeneously orderable graphs, and we show that it has polynomial time complexity. In partic...
Stavros D. Nikolopoulos, Leonidas Palios
FAW
2007
Springer
115views Algorithms» more  FAW 2007»
13 years 9 months ago
An O ( nm )-Time Certifying Algorithm for Recognizing HHD-Free Graphs
In this paper, we consider the recognition problem on a class of perfectly orderable graphs, namely, the HHD-free graphs, i.e., graphs that do not contain any induced subgraph iso...
Stavros D. Nikolopoulos, Leonidas Palios