A four-sweep LBFS recognition algorithm for interval graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2014

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.
Fichier principal
Vignette du fichier
dmtcs-16-3-2.pdf (535.59 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01188908 , version 1 (31-08-2015)

Identifiers

Cite

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

Collections

TDS-MACS
124 View
951 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More