Skip to Main content Skip to Navigation
Journal articles

A four-sweep LBFS recognition algorithm for interval graphs

Abstract : In their 2009 paper, Corneil et al. design a linear time interval graph recognition algorithm based on six sweeps of Lexicographic Breadth-First Search (LBFS) and prove its correctness. They believe that their corresponding 5-sweep LBFS interval graph recognition algorithm is also correct. Thanks to the LBFS structure theory established mainly by Corneil et al., we are able to present a 4-sweep LBFS algorithm which determines whether or not the input graph is a unit interval graph or an interval graph. Like the algorithm of Corneil et al., our algorithm does not involve any complicated data structure and can be executed in linear time.
Document type :
Journal articles
Complete list of metadata

Cited literature [50 references]  Display  Hide  Download

https://hal.inria.fr/hal-01188908
Contributor : Coordination Episciences Iam <>
Submitted on : Monday, August 31, 2015 - 5:03:34 PM
Last modification on : Thursday, September 7, 2017 - 1:03:47 AM
Long-term archiving on: : Tuesday, December 1, 2015 - 10:43:29 AM

File

dmtcs-16-3-2.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-01188908, version 1

Collections

Citation

Peng Li, Yaokun Wu. A four-sweep LBFS recognition algorithm for interval graphs. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2014, Vol. 16 no. 3 (in progress) (3), pp.23--50. ⟨hal-01188908⟩

Share

Metrics

Record views

160

Files downloads

1064