Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees

Annual Symposium on Foundations of Computer Science (Proceedings)

Volumn , Issue , 1991, Pages 632-641

  Frederickson, Greg N ^a  

^a PURDUE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER METATHEORY - COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING - ALGORITHMS;

AMBIVALENT DATA PROCESSING; DYNAMIC TWO-EDGE CONNECTIVITY; EMBEDDED PLANAR GRAPHS; SPANNING TREE PROBLEMS; UNDIRECTED GRAPHS;

DATA PROCESSING;

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

References (31)