✦ LIBER ✦

Faster algorithms for finding and counting subgraphs

✍ Scribed by Fedor V. Fomin; Daniel Lokshtanov; Venkatesh Raman; Saket Saurabh; B.V. Raghavendra Rao

Book ID: 113698488
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 210 KB
Volume: 78
Category: Article
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2011.10.001

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Finding, Minimizing, and Counting Weight

Finding, Minimizing, and Counting Weighted Subgraphs

✍ Williams, Virginia Vassilevska; Williams, Ryan 📂 Article 📅 2013 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 339 KB

Approximation algorithms for finding low

Approximation algorithms for finding low-degree subgraphs

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

A local algorithm for finding dense subg

A local algorithm for finding dense subgraphs

✍ Andersen, Reid 📂 Article 📅 2010 🏛 Association for Computing Machinery 🌐 English ⚖ 119 KB

A Better Approximation Algorithm for Fin

A Better Approximation Algorithm for Finding Planar Subgraphs

✍ Gruia Călinescu; Cristina G Fernandes; Ulrich Finkler; Howard Karloff 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 321 KB

The MAXIMUM PLANAR SUBGRAPH problemᎏgiven a graph G, find a largest planar subgraph of Gᎏhas applications in circuit layout, facility layout, and graph drawing. No previous polynomial-time approximation algorithm for this NP-Complete problem was known to achieve a performance ratio larger than 1r3,

Faster Algorithms for Subgraph Isomorphi

Faster Algorithms for Subgraph Isomorphism ofsl k-Connected Partialsl k-Trees

✍ A. Dessmark; A. Lingas; A. Proskurowski 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 68 KB

A faster algorithm for finding edge-disj

A faster algorithm for finding edge-disjoint branchings

✍ Po Tong; E.L. Lawler 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 371 KB