Using expander graphs to find vertex connectivity

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2000, Pages 410-420

  Gabow, Harold N ^a  

^a UNIVERSITY OF COLORADO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; THEOREM PROVING;

EXPANDER GRAPHS;

GRAPH THEORY;

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

References (18)