A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs

62Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.

Abstract

We present a simple linear time algorithm for unit interval graph recognition. This algorithm uses 3 LBFS sweeps and then a very simple test to determine if the given graph is a unit interval graph. It is argued that this algorithm is the most easily implementable unit interval graph recognition algorithm known. © 2003 Elsevier B.V. All rights reserved.

Cite

CITATION STYLE

APA

Corneil, D. G. (2004). A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs. Discrete Applied Mathematics, 138(3), 371–379. https://doi.org/10.1016/j.dam.2003.07.001

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free