𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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

✍ Scribed by Hell, Pavol; Huang, Jing

Book ID
111989404
Publisher
Society for Industrial and Applied Mathematics
Year
2004
Tongue
English
Weight
211 KB
Volume
18
Category
Article
ISSN
0895-4801

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

Lexicographic orientation and representa
Lexicographic orientation and representation algorithms for comparability graphs, proper circular arc graphs, and proper interval graphs
✍ Pavon Hell; Jing Huang πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 823 KB

## Abstract We introduce a simple new technique which allows us to solve several problems that can be formulated as seeking a suitable orientation of a given undirected graph. In particular, we use this technique to recognize and transitively orient comparability graphs, to recognize and represent