𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Recognition of probe proper interval graphs

✍ Scribed by Nussbaum, Yahav

Book ID
122213090
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
424 KB
Volume
167
Category
Article
ISSN
0166-218X

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

Minimum proper interval graphs
Minimum proper interval graphs
✍ M. Gutierrez; L. OubiΓ±a πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 546 KB

A graph G is a proper interval graph if there exists a mapping r from V(G) to the class of closed intervals of the real line with the properties that for distinct vertices u and w we have r(u) n r(w) # 0 if and only if u and w are adjacent and neither of the intervals r(u), r(w) contain the other. W

A relationship between triangulated grap
A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular-arc graphs, and nested interval graphs
✍ Dale J. Skrien πŸ“‚ Article πŸ“… 1982 πŸ› John Wiley and Sons 🌐 English βš– 319 KB πŸ‘ 1 views

## Abstract Given a set __F__ of digraphs, we say a graph __G__ is a __F__‐__graph__ (resp., __F__\*‐__graph__) if it has an orientation (resp., acyclic orientation) that has no induced subdigraphs isomorphic to any of the digraphs in __F__. It is proved that all the classes of graphs mentioned in

Tagged Probe Interval Graphs
Tagged Probe Interval Graphs
✍ Li Sheng; Chi Wang; Peisen Zhang πŸ“‚ Article πŸ“… 2001 πŸ› Springer US 🌐 English βš– 60 KB