𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An O(n3)-Time Recognition Algorithm for hhds-free Graphs

✍ Scribed by Elaine M. Eschen; Chính T. Hoàng; R. Sritharan

Book ID
106047651
Publisher
Springer Japan
Year
2007
Tongue
English
Weight
217 KB
Volume
23
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Õ(n314)-coloring algorithm for 3-col
An Õ(n314)-coloring algorithm for 3-colorable graphs
✍ Avrim Blum; David Karger 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 471 KB

We show how the results of Karger, Motwani, and Sudan ( 1994) and Blum ( 1994) can be combined in a natural manner to yield a polynomial-time algorithm for d(n3"4 )-coloring any n-node 3-colorable graph. This improves on the previous best bound of 6(n'14) colors (Karger et al., 1994).

An O(n) time algorithm for maximum match
An O(n) time algorithm for maximum matching in P4-tidy graphs
✍ J.L. Fouquet; I. Parfenoff; H. Thuillier 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 630 KB

The A-tidy graphs were introduced by I. Rusu to generalize some already known classes of graphs with "few" induced P4 s. In this paper, we extend to PA-tidy graphs a linear time algorithm of C.-H. Yang and M.-S. Yu for finding a maximum matching in a cograph G (given a parse tree associated to G). @