✦ LIBER ✦

A Linear-Time Algorithm for Finding a Complete Graph Minor in a Dense Graph

✍ Scribed by Dujmović, Vida; Harvey, Daniel J.; Joret, Gwenaël; Reed, Bruce; Wood, David R.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A linear time algorithm for finding all

✍ Ting-Yem Ho; Yue-Li Wang; Ming-Tsan Juan 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 488 KB

A linear time algorithm for graph partit

✍ L.H. Clark; F. Shahrokhi; L.A. Székely 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 483 KB

A linear-time algorithm for finding a sp

✍ Hiroshi Nagamochi; Toshihide Ibaraki 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 684 KB

A linear-time algorithm for proper inter

✍ Celina M.Herrera de Figueiredo; João Meidanis; Célia Picinin de Mello 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 529 KB

Algorithm to assist in finding the Compl

✍ MEETHAM, A. R. 📂 Article 📅 1966 🏛 Nature Publishing Group 🌐 English ⚖ 123 KB

A linear-time algorithm for drawing a pl

✍ M. Chrobak; T.H. Payne 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 523 KB