"Minimum Cuts of Simple Graphs in Almost Always Linear Time."

Michael Brinkmeier (2009)

Details and statistics

DOI: 10.1007/978-3-642-00202-1_20

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-23

a service of  Schloss Dagstuhl - Leibniz Center for Informatics