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

Revisiting Tucker's Algorithm to Color Circular-Arc Graphs

โœ Scribed by Mario E. Valencia-Pabon

Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
292 KB
Volume
7
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An O(qn) algorithm to q-color a proper f
An O(qn) algorithm to q-color a proper family of circular arcs
โœ Austin Teng; Alan Tucker ๐Ÿ“‚ Article ๐Ÿ“… 1985 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 683 KB

A family of arcs on a circle is proper if no arc is properly contained within another. While general minimal arc coloring is NP-complete, Orlin et al. recently obtained on O(n') algorithm for q-coloring a proper family of arcs by modeling proper arc coloring as a shortest path problem in an associat

Maximum independent sets of circular-arc
Maximum independent sets of circular-arc graphs: Simplified algorithm and proofs
โœ Zheng, S. Q. ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 421 KB ๐Ÿ‘ 2 views

We present a simple optimal algorithm for the problem of finding maximum independent sets of circular-arc graphs. Given an intersection model S of a circular-arc graph G , our algorithm computes a maximum independent set of G in O ( n ) space and O ( n ) or O(n log n ) time, depending on whether the

A linear time algorithm to recognize cir
A linear time algorithm to recognize circular permutation graphs
โœ Sritharan, R. ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 368 KB

An undirected graph G is a circular permutation graph if it can be represented by the following intersectiori model: Each vertex of G corresponds to a chord in the annular region between two concentric circles, and two vertices are adjacent in G if and only if their corresponding chords intersect ea