Dorit S. Hochbaum, Asaf Levin. Covering the Edges of Bipartite Graphs Using ::::K:::: ::2, 2:: Graphs. In Christos Kaklamanis, Martin Skutella, editors, Approximation and Online Algorithms, 5th International Workshop, WAOA 2007, Eilat, Israel, October 11-12, 2007. Revised Papers. Volume 4927 of Lecture Notes in Computer Science, pages 116-127, Springer, 2007. [doi]
@inproceedings{HochbaumL07,
title = {Covering the Edges of Bipartite Graphs Using ::::K:::: ::2, 2:: Graphs},
author = {Dorit S. Hochbaum and Asaf Levin},
year = {2007},
doi = {10.1007/978-3-540-77918-6_10},
url = {http://dx.doi.org/10.1007/978-3-540-77918-6_10},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/HochbaumL07},
cites = {0},
citedby = {0},
pages = {116-127},
booktitle = {Approximation and Online Algorithms, 5th International Workshop, WAOA 2007, Eilat, Israel, October 11-12, 2007. Revised Papers},
editor = {Christos Kaklamanis and Martin Skutella},
volume = {4927},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-540-77917-9},
}