✦ LIBER ✦

Efficient parallel recognition of some circular arc graphs, II

✍ Scribed by L. Chen

Book ID: 110547416
Publisher: Springer
Year: 1997
Tongue: English
Weight: 760 KB
Volume: 17
Category: Article
ISSN: 0178-4617
DOI: 10.1007/bf02523192

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Linear-Time Recognition of Circular-Arc

Linear-Time Recognition of Circular-Arc Graphs

✍ Ross M. McConnell 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 472 KB

Linear-Time Recognition of Helly Circula

Linear-Time Recognition of Helly Circular-Arc Models and Graphs

✍ Benson L. Joeris; Min Chih Lin; Ross M. McConnell; Jeremy P. Spinrad; Jayme L. S 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 652 KB

Efficient approximation algorithms for d

Efficient approximation algorithms for domatic partition and on-line coloring of circular arc graphs

✍ M.V. Marathe; H.B. Hunt III; S.S. Ravi 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 1009 KB

An Efficient Parallel Algorithm for Maxi

An Efficient Parallel Algorithm for Maximum Matching for Some Classes of Graphs

✍ I. Parfenoff 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 403 KB

The P 4 -tidy graphs were introduced by I. Rusu to generalize some already known classes of graphs with few induced P 4 (cographs, P 4 -sparse graphs, P 4 -lite graphs). Here, we propose an extension of R. Lin and S. Olariu's work (1994. J. Parallel Distributed Computing 22, 26 36.) on cographs, usi