André Berger, Michelangelo Grigni. Minimum Weight 2-Edge-Connected Spanning Subgraphs in Planar Graphs. In Lars Arge, Christian Cachin, Tomasz Jurdzinski, Andrzej Tarlecki, editors, Automata, Languages and Programming, 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings. Volume 4596 of Lecture Notes in Computer Science, pages 90-101, Springer, 2007. [doi]
@inproceedings{BergerG07,
title = {Minimum Weight 2-Edge-Connected Spanning Subgraphs in Planar Graphs},
author = {André Berger and Michelangelo Grigni},
year = {2007},
doi = {10.1007/978-3-540-73420-8_10},
url = {http://dx.doi.org/10.1007/978-3-540-73420-8_10},
tags = {planar graph, graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/BergerG07},
cites = {0},
citedby = {0},
pages = {90-101},
booktitle = {Automata, Languages and Programming, 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings},
editor = {Lars Arge and Christian Cachin and Tomasz Jurdzinski and Andrzej Tarlecki},
volume = {4596},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-540-73419-2},
}