𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Covering of graphs by complete bipartite subgraphs; Complexity of 0–1 matrices

✍ Scribed by Zsolt Tuza

Book ID
110564217
Publisher
Springer-Verlag
Year
1984
Tongue
English
Weight
276 KB
Volume
4
Category
Article
ISSN
0209-9683

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

On the number of irreducible coverings b
On the number of irreducible coverings by edges of complete bipartite graphs
✍ Ioan Tomescu 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 102 KB

In this paper it is proved that the exponential generating function of the numbers, denoted by N(p, q), of irreducible coverings by edges of the vertices of complete bipartite graphs Kp.q equals exp(xe r + ye x -x -y -xy) -t.

[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