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

Unit Circular-Arc Graph Representations and Feasible Circulations

โœ Scribed by Lin, Min Chih; Szwarcfiter, Jayme L.

Book ID
118196926
Publisher
Society for Industrial and Applied Mathematics
Year
2008
Tongue
English
Weight
250 KB
Volume
22
Category
Article
ISSN
0895-4801

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

List Homomorphisms and Circular Arc Grap
List Homomorphisms and Circular Arc Graphs
โœ Tomas Feder; Pavol Hell; Jing Huang ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Springer-Verlag ๐ŸŒ English โš– 326 KB
Interval bigraphs and circular arc graph
Interval bigraphs and circular arc graphs
โœ Pavol Hell; Jing Huang ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 130 KB

## Abstract We prove that the complements of interval bigraphs are precisely those circular arc graphs of clique covering number two, which admit a representation without two arcs covering the whole circle. We give another characterization of interval bigraphs, in terms of a vertex ordering, that w

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