Portal de Periódicos da CAPES

Artigo Produção Nacional Revisado por pares

BIBTEX RIS

A linear-time algorithm for proper interval graph recognition

1995; Elsevier BV; Volume: 56; Issue: 3 Linguagem: Inglês

10.1016/0020-0190(95)00133-w

1872-6119

Celina M.H. de Figueiredo, João Meidânis, Célia Picinin de Mello,

Graph Theory and Algorithms

Interval graphs are the intersection graphs of families of intervals in the real line. If the intervals can be chosen so that no interval contains another, we obtain the subclass of proper interval graphs. We show how to recognize proper interval graphs in linear time by constructing the clique partition from the output of a single lexicographic breadth-first search.