Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

WG
2005
Springer

favoriteEmaildiscussreport

82views Theoretical Computer Science» more WG 2005»

Recognizing HHDS-Free Graphs

13 years 9 months ago

Recognizing HHDS-Free Graphs

Download www.csie.ntu.edu.tw

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 ﬁrst polynomial-time algorithm for recognizing this class of graphs.

Stavros D. Nikolopoulos, Leonidas Palios

Real-time Traffic

Computer Science | Orderable Graphs | Polynomial Time Complexity | WG 2005 | ﬁrst Polynomial-time Algorithm |

claim paper

Related Content

» Recognizing Perfect 2Split Graphs

» A Fully Dynamic Graph Algorithm for Recognizing Interval Graphs

» Recognizing edge clique graphs among interval graphs and probe interval graphs

» Recognizing dInterval Graphs and dTrack Interval Graphs

» Recognizing HoleFree 4Map Graphs in Cubic Time

» An O nm Time Certifying Algorithm for Recognizing HHDFree Graphs

» Generalized Graph Clustering Recognizing p qCluster Graphs

» Certifying algorithms for recognizing interval graphs and permutation graphs

» Recognizing string graphs in NP

Post Info
More Details (n/a)

Added	28 Jun 2010
Updated	28 Jun 2010
Type	Conference
Year	2005
Where	WG
Authors	Stavros D. Nikolopoulos, Leonidas Palios

Comments (0)