Finding the k most vital edges with respect to minimum spanning tree

National Aerospace and Electronics Conference, Proceedings of the IEEE

Volumn 1, Issue , 1997, Pages 255-262

  Shen, Hong ^a  

^a GRIFFITH UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

EDGE REPLACEMENT METHOD; POLYNOMIAL TIME RANDOMIZED ALGORITHMS;

APPROXIMATION THEORY; OPTIMIZATION; PARALLEL ALGORITHMS; POLYNOMIALS; PROBABILITY; PROBLEM SOLVING; RANDOM ACCESS STORAGE; RANDOM PROCESSES; TREES (MATHEMATICS);

PARALLEL PROCESSING SYSTEMS;

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

References (19)