𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Finding, Minimizing, and Counting Weighted Subgraphs

✍ Scribed by Williams, Virginia Vassilevska; Williams, Ryan


Book ID
121231575
Publisher
Society for Industrial and Applied Mathematics
Year
2013
Tongue
English
Weight
339 KB
Volume
42
Category
Article
ISSN
0097-5397

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
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