"Minimum S-T Cut of a Planar Undirected Network in O(n log²(n)) Time."

John H. Reif (1981)

Details and statistics

DOI: 10.1007/3-540-10843-2_5

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-19

a service of  Schloss Dagstuhl - Leibniz Center for Informatics