𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A linear-time recognition algorithm for interval dags

✍ Scribed by Harold N. Gabow


Book ID
113162346
Publisher
Elsevier Science
Year
1981
Tongue
English
Weight
412 KB
Volume
12
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


A linear time recognition algorithm for
✍ 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