Faster deterministic algorithm for minimum spanning trees

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 1997, Pages 22-31

  Chazelle, Bernard ^a  

^a PRINCETON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; FUNCTIONS;

ACKERMANN'S FUNCTION; MINIMUM SPANNING TREES;

TREES (MATHEMATICS);

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

References (10)