✦ LIBER ✦

[Lecture Notes in Computer Science] Combinatorial Optimization and Applications Volume 6508 || Finding Strong Bridges and Strong Articulation Points in Linear Time

✍ Scribed by Wu, Weili; Daescu, Ovidiu

Book ID: 120627481
Publisher: Springer Berlin Heidelberg
Year: 2010
Weight: 188 KB
Category: Article
ISBN: 3642174582
DOI: 10.1007/978-3-642-17458-2_14

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Finding strong bridges and strong articu

Finding strong bridges and strong articulation points in linear time

✍ Giuseppe F. Italiano; Luigi Laura; Federico Santaroni 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 276 KB

[Lecture Notes in Computer Science] Comb

[Lecture Notes in Computer Science] Combinatorial Optimization and Applications Volume 6508 || The Union of Colorful Simplices Spanned by a Colored Point Set

✍ Wu, Weili; Daescu, Ovidiu 📂 Article 📅 2010 🏛 Springer Berlin Heidelberg ⚖ 551 KB

[Lecture Notes in Computer Science] Foun

[Lecture Notes in Computer Science] Foundations of Software Technology and Theoretical Computer Science Volume 405 || An efficient distributed algorithm for finding articulation points, Bridges, and biconnected components in asynchronous networks

✍ Veni Madhavan, C. E. 📂 Article 📅 1989 🏛 Springer Berlin Heidelberg ⚖ 577 KB

[Lecture Notes in Computer Science] Comb

[Lecture Notes in Computer Science] Combinatorial Optimization and Applications Volume 4616 || Energy Minimizing Vehicle Routing Problem

✍ Dress, Andreas; Xu, Yinfeng; Zhu, Binhai 📂 Article 📅 2007 🏛 Springer Berlin Heidelberg ⚖ 308 KB

[Lecture Notes in Computer Science] Comb

[Lecture Notes in Computer Science] Combinatorial Optimization and Applications Volume 4616 || An Algorithm for Computing Virtual Cut Points in Finite Metric Spaces

✍ Dress, Andreas; Xu, Yinfeng; Zhu, Binhai 📂 Article 📅 2007 🏛 Springer Berlin Heidelberg ⚖ 365 KB

[Lecture Notes in Computer Science] Comb

[Lecture Notes in Computer Science] Combinatorial Optimization and Applications Volume 6831 || A Note on Treewidth in Random Graphs

✍ Wang, Weifan; Zhu, Xuding; Du, Ding-Zhu 📂 Article 📅 2011 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 185 KB

This Book Constitutes The Refereed Proceedings Of The 5th International Conference On Combinatorial Optimization And Applications, Cocoa 2011, Held In Zhangjiajie, China, In August 2011. The 43 Revised Full Papers Were Carefully Reviewed And Selected From 65 Submissions. The Papers Cover A Broad Ran