Noga Alon, Raphael Yuster. Fast Algorithms for Maximum Subset Matching and All-Pairs Shortest Paths in Graphs with a (Not So) Small Vertex Cover. In Lars Arge, Michael Hoffmann, Emo Welzl, editors, Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings. Volume 4698 of Lecture Notes in Computer Science, pages 175-186, Springer, 2007. [doi]
@inproceedings{AlonY07,
title = {Fast Algorithms for Maximum Subset Matching and All-Pairs Shortest Paths in Graphs with a (Not So) Small Vertex Cover},
author = {Noga Alon and Raphael Yuster},
year = {2007},
doi = {10.1007/978-3-540-75520-3_17},
url = {http://dx.doi.org/10.1007/978-3-540-75520-3_17},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/AlonY07},
cites = {0},
citedby = {0},
pages = {175-186},
booktitle = {Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings},
editor = {Lars Arge and Michael Hoffmann and Emo Welzl},
volume = {4698},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-540-75519-7},
}