Skip to Main content Skip to Navigation
Journal articles

Recognizing HH-free, HHD-free, and Welsh-Powell Opposition Graphs

Abstract : In this paper, we consider the recognition problem on three classes of perfectly orderable graphs, namely, the HH-free, the HHD-free, and the Welsh-Powell opposition graphs (or WPO-graphs). In particular, we prove properties of the chordal completion of a graph and show that a modified version of the classic linear-time algorithm for testing for a perfect elimination ordering can be efficiently used to determine in O(n min \m α (n,n), m + n^2 log n\) time whether a given graph G on n vertices and m edges contains a house or a hole; this implies an O(n min \m α (n,n), m + n^2 log n\)-time and O(n+m)-space algorithm for recognizing HH-free graphs, and in turn leads to an HHD-free graph recognition algorithm exhibiting the same time and space complexity. We also show that determining whether the complement øverlineG of the graph G is HH-free can be efficiently resolved in O(n m) time using O(n^2) space, which leads to an O(n m)-time and O(n^2)-space algorithm for recognizing WPO-graphs. The previously best algorithms for recognizing HH-free, HHD-free, and WPO-graphs required O(n^3) time and O(n^2) space.
Document type :
Journal articles
Complete list of metadata

Cited literature [15 references]  Display  Hide  Download
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s Connect in order to contact the contributor
Submitted on : Wednesday, March 19, 2014 - 2:30:18 PM
Last modification on : Wednesday, November 29, 2017 - 10:26:23 AM
Long-term archiving on: : Thursday, June 19, 2014 - 11:35:38 AM


Files produced by the author(s)




Stavros D. Nikolopoulos, Leonidas Palios. Recognizing HH-free, HHD-free, and Welsh-Powell Opposition Graphs. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2006, Vol. 8, pp.65-82. ⟨10.46298/dmtcs.370⟩. ⟨hal-00961102⟩



Record views


Files downloads