๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Fast and Simple Algorithms for Recognizing Chordal Comparability Graphs and Interval Graphs

โœ Scribed by Hsu, Wen-Lian; Ma, Tze-Heng

Book ID
118177315
Publisher
Society for Industrial and Applied Mathematics
Year
1998
Tongue
English
Weight
323 KB
Volume
28
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

Efficient algorithms for interval graphs
Efficient algorithms for interval graphs and circular-arc graphs
โœ U. I. Gupta; D. T. Lee; J. Y.-T. Leung ๐Ÿ“‚ Article ๐Ÿ“… 1982 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 476 KB

## Abstract We show that for an interval graph given in the form of a family of intervals, a maximum independent set, a minimum covering by disjoint completely connected sets or cliques, and a maximum clique can all be found in __O__(__n__ log __n__) time [__O__(__n__) time if the endpoints of the