𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Fully Dynamic Algorithm for Recognizing and Representing Proper Interval Graphs

✍ Scribed by Hell, Pavol; Shamir, Ron; Sharan, Roded

Book ID
118180382
Publisher
Society for Industrial and Applied Mathematics
Year
2001
Tongue
English
Weight
192 KB
Volume
31
Category
Article
ISSN
0097-5397

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