✦ LIBER ✦

[Lecture Notes in Computer Science] Algorithm Theory – SWAT 2012 Volume 7357 || Linear Time Algorithm for Computing a Small Biclique in Graphs without Long Induced Paths

✍ Scribed by Fomin, Fedor V.; Kaski, Petteri

Book ID: 120249175
Publisher: Springer Berlin Heidelberg
Year: 2012
Weight: 216 KB
Category: Article
ISBN: 3642311555
DOI: 10.1007/978-3-642-31155-0_13

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithm Theory – SWAT 2012 Volume 7357 || A Simple Framework for the Generalized Nearest Neighbor Problem

✍ Fomin, Fedor V.; Kaski, Petteri 📂 Article 📅 2012 🏛 Springer Berlin Heidelberg ⚖ 230 KB

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithm Theory - SWAT 2000 Volume 1851 || A d/2 Approximation for Maximum Weight Independent Set in d-Claw Free Graphs

✍ Berman, Piotr 📂 Article 📅 2000 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 184 KB

This Book Constitutes The Refereed Proceedings Of The 7th Scandinavian Workshop On Algorithm Theory, Swat 2000, Held In Bergen, Norway, In July 2000. The 43 Revised Full Papers Presented Together With 3 Invited Contributions Were Carefully Reviewed And Selected From A Total Of 105 Submissions. The P