论文信息 - Minimum cut in directed planar networks - 字舞流文

Minimum cut in directed planar networks

Václav Koubek | Ladislav Janiga | V. Koubek | Ladislav Janiga

[1] Michael L. Fredman,et al. Trans-Dichotomous Algorithms for Minimum Spanning Trees and Shortest Paths , 1994, J. Comput. Syst. Sci..

[2] Robert E. Tarjan,et al. Efficient Planarity Testing , 1974, JACM.

[3] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[4] Václav Koubek,et al. A Note on Finding Minimum Cuts in Directed Planar Networks by Parallel Computations , 1985, Inf. Process. Lett..

[5] Kurt Mehlhorn,et al. Data Structures and Algorithms 2: Graph Algorithms and NP-Completeness , 1984, EATCS Monographs on Theoretical Computer Science.

[6] Alon Itai,et al. Maximum Flow in Planar Networks , 1979, SIAM J. Comput..

[7] Robert E. Tarjan,et al. Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.

[8] John H. Reif,et al. Minimum S-T Cut of a Planar Undirected Network in O(n log²(n)) Time , 1981, ICALP.