✦ LIBER ✦

Solving maximum clique in sparse graphs: an(O(nm+n2^{d/4}))algorithm for(d)-degenerate graphs

✍ Scribed by Buchanan, Austin; Walteros, Jose L.; Butenko, Sergiy; Pardalos, Panos M.

Book ID: 121615268
Publisher: Springer-Verlag
Year: 2013
Tongue: English
Weight: 188 KB
Volume: 8
Category: Article
ISSN: 1862-4472
DOI: 10.1007/s11590-013-0698-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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). @