The Two-Edge Connectivity Survivable Network Problem in Planar Graphs

Glencora Borradaile, Philip N. Klein. The Two-Edge Connectivity Survivable Network Problem in Planar Graphs. In Luca Aceto, Ivan Damgård, Leslie Ann Goldberg, Magnús M. Halldórsson, Anna Ingólfsdóttir, Igor Walukiewicz, editors, Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I: Tack A: Algorithms, Automata, Complexity, and Games. Volume 5125 of Lecture Notes in Computer Science, pages 485-501, Springer, 2008. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.