Fast randomized algorithms for computing minimum {3,4,5,6}-way cuts

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2000, Pages 735-742

  Levine, Matthew S ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDARY CONDITIONS; GRAPH THEORY; OPTIMIZATION; RANDOM PROCESSES; SET THEORY;

RANDOMIZED ALGORITHMS; UNDIRECTED GRAPHS;

ALGORITHMS;

EID: 0033895879     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)