✦ LIBER ✦

Graph Searching and Interval Completion

✍ Scribed by Fomin, Fedor V.; Golovach, Petr A.

Book ID: 118199608
Publisher: Society for Industrial and Applied Mathematics
Year: 2000
Tongue: English
Weight: 150 KB
Volume: 13
Category: Article
ISSN: 0895-4801
DOI: 10.1137/s0895480199350477

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimal interval completion through grap

Minimal interval completion through graph exploration

✍ Karol Suchan; Ioan Todinca 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 917 KB

NP-completeness of interval graph comple

NP-completeness of interval graph completion from a path graph

✍ Kazuaki Yamaguchi; Toshiro Araki; Toshinobu Kashiwabara 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 449 KB

Interval dimension and MacNeille complet

Interval dimension and MacNeille completion

✍ Michel Habib; Michel Morvan; Maurice Pouzet; Jean-Xavier Rampon 📂 Article 📅 1993 🏛 Springer Netherlands 🌐 English ⚖ 331 KB

Achromatic number is NP-complete for cog

Achromatic number is NP-complete for cographs and interval graphs

✍ Hans L. Bodlaender 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 477 KB

Mixed search number and linear-width of

Mixed search number and linear-width of interval and split graphs

✍ Fedor V. Fomin; Pinar Heggernes; Rodica Mihai 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 107 KB

Interval graphs and interval orders

✍ Peter C. Fishburn 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 949 KB

This paper explores the intimate connection between finite interval graphs and interval orders. Special attention is given to the family of interval orders that agree with, or provide representations of, an interval graph. Two characterizations (one by P. Hanlon) of interval graphs with essentially