FINDING NEAR OPTIMAL SEPARATORS IN PLANAR GRAPHS.

Annual Symposium on Foundations of Computer Science (Proceedings)

Volumn , Issue , 1987, Pages 225-237

  Rao, Satish ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS;

APPROXIMATION ALGORITHMS; K-RATIO EDGE SEPARATOR; NEAR OPTIMAL SEPARATORS; PLANAR GRAPHS;

MATHEMATICAL TECHNIQUES;

EID: 0023593447     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/sfcs.1987.26     Document Type: Conference Paper

References (13)