✦ LIBER ✦

New sequential and parallel algorithms for interval graph recognition

✍ Scribed by G. Ramalingam; C. Pandu Rangan

Book ID: 107765920
Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 370 KB
Volume: 34
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(90)90163-r

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parallel algorithms for connectivity pro

Parallel algorithms for connectivity problems on interval graphs

✍ Sanjeev Saxena; N.Malahal Rao 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 743 KB

Certifying LexBFS Recognition Algorithms

Certifying LexBFS Recognition Algorithms for Proper Interval Graphs and Proper Interval Bigraphs

✍ Hell, Pavol; Huang, Jing 📂 Article 📅 2004 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 211 KB

The optimal sequential and parallel algo

The optimal sequential and parallel algorithms to compute all hinge vertices on interval graphs

✍ Bera, Debashis ;Pal, Madhumangal ;Pal, Tapan K. 📂 Article 📅 2001 🏛 Springer-Verlag 🌐 English ⚖ 208 KB

Parallel computation on interval graphs:

Parallel computation on interval graphs: algorithms and experiments

✍ A. Ferreira; I. Guérin Lassous; K. Marcus; A. Rau-Chaplin 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 264 KB

A linear-time algorithm for proper inter

A linear-time algorithm for proper interval graph recognition

✍ Celina M.Herrera de Figueiredo; João Meidanis; Célia Picinin de Mello 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 529 KB

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