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 particular, we describe a simple O(n2 m)-time algorithm which determines whether a graph G on n vertices and m edges is HHDS-free. To the best of our knowledge, this is the first polynomial-time algorithm for recognizing this class of graphs.

• Type: Conference
• Year: 2005
• Where: WG
• Authors: Stavros D. Nikolopoulos, Leonidas Palios
• Keywords: Computer Science, Orderable Graphs, Polynomial Time Complexity, WG 2005, first Polynomial-time Algorithm