✦ LIBER ✦

[Lecture Notes in Computer Science] Algorithms and Complexity Volume 6078 || Packing Bipartite Graphs with Covers of Complete Bipartite Graphs

✍ Scribed by Calamoneri, Tiziana; Diaz, Josep

Book ID: 120646960
Publisher: Springer Berlin Heidelberg
Year: 2010
Tongue: German
Weight: 227 KB
Category: Article
ISBN: 3642130739
DOI: 10.1007/978-3-642-13073-1_25

No coin nor oath required. For personal study only.

✦ Synopsis

This Book Constitutes The Refereed Proceedings Of The 7th International Conference On Algorithms And Computation, Ciac 2010, Held In Rome, Italy, In May 2010. The 30 Revised Full Papers Presented Together With 3 Invited Papers Were Carefully Reviewed And Selected From 114 Submissions. Among The Topics Addressed Are Graph Algorithms I, Computational Complexity, Graph Coloring, Tree Algorithms And Tree Decompositions, Computational Geometry, Game Theory, Graph Algorithms Ii, And String Algorithms.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Comb

[Lecture Notes in Computer Science] Combinatorics and Computer Science Volume 1120 || Complete bipartite decompositions of crowns, with applications to complete directed graphs

✍ Deza, Michel; Euler, Reinhardt; Manoussakis, Ioannis 📂 Article 📅 1996 🏛 Springer Berlin Heidelberg ⚖ 386 KB

[Lecture Notes in Computer Science] Appr

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

✍ Kaklamanis, Christos; Skutella, Martin 📂 Article 📅 2008 🏛 Springer Berlin Heidelberg ⚖ 514 KB

[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

[Lecture Notes in Computer Science] Disc

[Lecture Notes in Computer Science] Discrete Geometry, Combinatorics and Graph Theory Volume 4381 || Three Classes of Bipartite Integral Graphs

✍ Akiyama, Jin; Chen, William Y. C.; Kano, Mikio; Li, Xueliang; Yu, Qinglin 📂 Article 📅 2007 🏛 Springer Berlin Heidelberg ⚖ 197 KB

[Lecture Notes in Computer Science] Grap

[Lecture Notes in Computer Science] Graph Theoretic Concepts in Computer Science Volume 6410 || Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time

✍ Thilikos, Dimitrios M. 📂 Article 📅 2010 🏛 Springer Berlin Heidelberg 🌐 English ⚖ 204 KB

The 36th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2010) took place in Zar´ os, Crete, Greece, June 28–30, 2010. About 60 mathematicians and computer scientists from all over the world (Australia, Canada, Czech Republic, France, Germany, Greece, Hungary, Israel, Japa

[Lecture Notes in Computer Science] Grap

[Lecture Notes in Computer Science] Graph-Theoretic Concepts in Computer Science Volume 5911 || Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes

✍ Paul, Christophe; Habib, Michel 📂 Article 📅 2010 🏛 Springer Berlin Heidelberg ⚖ 240 KB