𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Simple linear time recognition of unit interval graphs

✍ Scribed by Derek G Corneil; Hiryoung Kim; Sridhar Natarajan; Stephan Olariu; Alan P Sprague

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
560 KB
Volume
55
Category
Article
ISSN
0020-0190

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

SIMPLE MAX-CUT for unit interval graphs
SIMPLE MAX-CUT for unit interval graphs and graphs with few P4s
✍ Hans L. Bodlaender; Ton Kloks; Rolf Niedermeier πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 56 KB

The SIMPLE MAX-CUT problem can be solved in linear time for unit interval graphs. We show also that for each constant q, the SIMPLE MAX-CUT problem can be solved in polynomial time for (q, q -4)-graphs.

Linear recognition of pseudo-split graph
Linear recognition of pseudo-split graphs
✍ FrΓ©dΓ©ric Maffray; Myriam Preissmann πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 370 KB
A Simple Linear Time Algorithm for Trian
A Simple Linear Time Algorithm for Triangulating Three-Colored Graphs
✍ H. Bodlaender; T. Kloks πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 560 KB

In this paper we consider the problem of determining whether a given colored graph can be triangulated, such that no edges between vertices of the same color are added. This problem originated from the perfect phylogeny problem from molecular biology and is strongly related with the problem of recog