A linear time recognition algorithm for proper interval graphs

Authors:
B. S. Panda;Sajal K. Das
Affiliations:
Computer Science and Application Group, Department of Mathematics, Indian Institute of Technology Delhi, Hauz Khas, New Delhi 110 016, India;Department of Computer Science and Engineering, The University of Texas at Arlinton, Arlington, TX
Venue:
Information Processing Letters
Year:
2003

Citing 12
Cited 12

Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs

SIAM Journal on Computing
Hamiltonian circuits in interval graph generalizations

Information Processing Letters
An incremental linear-time algorithm for recognizing interval graphs

SIAM Journal on Computing
Finding Hamiltonian cycles in certain planar graphs

Information Processing Letters
An O(n2 log n) algorithm for the Hamiltonian cycle problem on circular-arc graphs

SIAM Journal on Computing
Polynomial time algorithms for Hamiltonian problems on bipartite distance-hereditary graphs

Information Processing Letters
Simple linear time recognition of unit interval graphs

Information Processing Letters
Intersection graphs of vertex disjoint paths in a tree

Discrete Mathematics
On the Desirability of Acyclic Database Schemes

Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A Simple Test for Interval Graphs

WG '92 Proceedings of the 18th International Workshop on Graph-Theoretic Concepts in Computer Science
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

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

Discrete Applied Mathematics
Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs

Discrete Applied Mathematics
Minimal proper interval completions

Information Processing Letters
Random Generation and Enumeration of Proper Interval Graphs

WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
A parallel algorithm for generating bicompatible elimination orderings of proper interval graphs

Information Processing Letters
A simple algorithm to find Hamiltonian cycles in proper interval graphs

Information Processing Letters
Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs

Discrete Applied Mathematics
A polynomial solution to the k-fixed-endpoint path cover problem on proper interval graphs

Theoretical Computer Science
Measuring indifference: unit interval vertex deletion

WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Minimal proper interval completions

WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Computing a minimum outer-connected dominating set for the class of chordal graphs

Information Processing Letters
A linear time algorithm for liar's domination problem in proper interval graphs

Information Processing Letters

Quantified Score

Hi-index	0.89

Visualization

Abstract

We propose a linear time recognition algorithm for proper interval graphs. The algorithm is based on certain ordering of vertices, called bicompatible elimination ordering (BCO). Given a BCO of a biconnected proper interval graph G, we also propose a linear time algorithm to construct a Hamiltonian cycle of G.