Counting Minimum (::::s::::, ::::t::::)-Cuts in Weighted Planar Graphs in Polynomial Time

Ivona Bezáková, Adam J. Friedlander. Counting Minimum (::::s::::, ::::t::::)-Cuts in Weighted Planar Graphs in Polynomial Time. In Petr Hlinený, Antonín Kucera, editors, Mathematical Foundations of Computer Science 2010, 35th International Symposium, MFCS 2010, Brno, Czech Republic, August 23-27, 2010. Proceedings. Volume 6281 of Lecture Notes in Computer Science, pages 126-137, Springer, 2010. [doi]

Abstract

Abstract is missing.