𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A linear-time algorithm for proper interval graph recognition

✍ Scribed by Celina M.Herrera de Figueiredo; João Meidanis; Célia Picinin de Mello

Book ID
107766273
Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
529 KB
Volume
56
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A linear time recognition algorithm for
A linear time recognition algorithm for proper interval graphs
✍ B.S. Panda; Sajal K. Das 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 128 KB

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