𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Packing bipartite graphs with covers of complete bipartite graphs

✍ Scribed by Chalopin, Jérémie; Paulusma, Daniël

Book ID
123047346
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
385 KB
Volume
168
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Algo
[Lecture Notes in Computer Science] Algorithms and Complexity Volume 6078 || Packing Bipartite Graphs with Covers of Complete Bipartite Graphs
✍ Calamoneri, Tiziana; Diaz, Josep 📂 Article 📅 2010 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 227 KB

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 Topi

Packing two bipartite graphs into a comp
Packing two bipartite graphs into a complete bipartite graph
✍ Wang, Hong 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 131 KB 👁 3 views

For two integers a and b, we say that a bipartite graph G admits an (a, b)bipartition if G has a bipartition (X, Y ) such that |X| = a and |Y | = b. We say that two bipartite graphs G and H are compatible if, for some integers a and b, both G and H admit (a, b)-bipartitions. In this paper, we prove

Packing bipartite graphs
Packing bipartite graphs
✍ A. Pawel Wojda; Paul Vaderlind 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 383 KB

For two bipartite graphs G = (L, R; E) and G' = (L', R'; E') a bijection f: LwR --\* L'uR' such that f(L) = L' is called hi-placement when f(u)f(v)~E', for every edge uv ~ E (then G and G' are called hi-placeable). We give new sufficient conditions for bipartite graphs G and G' to be bi-placeable.