๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

[Lecture Notes in Computer Science] Approximation and Online Algorithms Volume 4927 || Covering the Edges of Bipartite Graphs Using K 2,2 Graphs

โœ Scribed by Kaklamanis, Christos; Skutella, Martin

Book ID
118230883
Publisher
Springer Berlin Heidelberg
Year
2008
Weight
514 KB
Category
Article
ISBN
3540779183

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

[Lecture Notes in Computer Science] Algo
[Lecture Notes in Computer Science] Algorithms and Computation Volume 6507 || k-cyclic Orientations of Graphs
โœ Cheong, Otfried; Chwa, Kyung-Yong; Park, Kunsoo ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Springer Berlin Heidelberg ๐ŸŒ German โš– 238 KB

Annotation This Book Constitutes The Refereed Proceedings Of The 21st International Symposium On Algorithms And Computation, Isaac 2010, Held In Jeju, South Korea In December 2010. The 77 Revised Full Papers Presented Were Carefully Reviewed And Selected From 182 Submissions For Inclusion In The Boo

[Lecture Notes in Computer Science] FSTT
[Lecture Notes in Computer Science] FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science Volume 4855 || Covering Graphs with Few Complete Bipartite Subgraphs
โœ Arvind, V.; Prasad, Sanjiva ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› Springer Berlin Heidelberg ๐ŸŒ English โš– 439 KB

This book constitutes the refereed proceedings of the 27th International Conference on the Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2007, held in New Delhi, India, in December 2007. The 40 revised full papers presented together with five invited papers were careful