Edoardo Amaldi, Claudio Iuliano, Romeo Rizzi. Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs. In Friedrich Eisenbrand, F. Bruce Shepherd, editors, Integer Programming and Combinatorial Optimization, 14th International Conference, IPCO 2010, Lausanne, Switzerland, June 9-11, 2010. Proceedings. Volume 6080 of Lecture Notes in Computer Science, pages 397-410, Springer, 2010. [doi]
@inproceedings{AmaldiIR10,
title = {Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs},
author = {Edoardo Amaldi and Claudio Iuliano and Romeo Rizzi},
year = {2010},
doi = {10.1007/978-3-642-13036-6_30},
url = {http://dx.doi.org/10.1007/978-3-642-13036-6_30},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/AmaldiIR10},
cites = {0},
citedby = {0},
pages = {397-410},
booktitle = {Integer Programming and Combinatorial Optimization, 14th International Conference, IPCO 2010, Lausanne, Switzerland, June 9-11, 2010. Proceedings},
editor = {Friedrich Eisenbrand and F. Bruce Shepherd},
volume = {6080},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-13035-9},
}