✦ LIBER ✦

Finding, Minimizing, and Counting Weighted Subgraphs

✍ Scribed by Williams, Virginia Vassilevska; Williams, Ryan

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Faster algorithms for finding and counti

✍ Fedor V. Fomin; Daniel Lokshtanov; Venkatesh Raman; Saket Saurabh; B.V. Raghaven 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 210 KB

ON FINDING CONSTRAINED MINIMUM WEIGHT SP

✍ RAYWARD-SMITH, V. J. 📂 Article 📅 1984 🏛 Taylor and Francis Group 🌐 English ⚖ 316 KB

Counting Subgraphs via Homomorphisms

✍ Amini, Omid; Fomin, Fedor V.; Saurabh, Saket 📂 Article 📅 2012 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 328 KB

On finding spanning eulerian subgraphs

✍ M. B. Richey; R. Gary Parker; R. L. Rardin 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 649 KB

Counting and Detecting Small Subgraphs v

✍ Kowaluk, Mirosław; Lingas, Andrzej; Lundell, Eva-Marta 📂 Article 📅 2013 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 315 KB

Approximation algorithms for finding low

✍ Philip N. Klein; Radha Krishnan; Balaji Raghavachari; R. Ravi 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 180 KB