✦ LIBER ✦

Finding minimum clique capacity

✍ Scribed by Maria Chudnovsky, Sang-Il Oum, Paul Seymour

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

2-Approximation algorithm for finding a

✍ Eremin, I. I.; Gimadi, E. Kh.; Kel’manov, A. V.; Pyatkin, A. V.; Khachai, M. Yu. 📂 Article 📅 2014 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 399 KB

Finding minimum cost directed trees with

✍ Choaib Bousba; Laurence A. Wolsey 📂 Article 📅 1991 🏛 Springer US 🌐 English ⚖ 817 KB

An algorithm for finding clique cut-sets

✍ S.H. Whitesides 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 247 KB

Algorithms for finding clique-transversa

✍ Guillermo Durán; Min Chih Lin; Sergio Mera; Jayme L. Szwarcfiter 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 313 KB

Minimum Clique Partition in Unit Disk Gr

✍ Adrian Dumitrescu; János Pach 📂 Article 📅 2011 🏛 Springer Japan 🌐 English ⚖ 269 KB

Algorithms for Minimum Coloring, Maximum

✍ Gavril, Fănică 📂 Article 📅 1972 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 813 KB