Fully dynamic algorithms for maintaining all-pairs shortest paths and transistive closure in digraphs

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 1999, Pages 81-89

  King, Valerie ^a  

^a UNIVERSITY OF VICTORIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; DATA STRUCTURES; ERRORS; GRAPH THEORY; SET THEORY;

ALL PAIRS SHORTEST PATHS; DIGRAPHS; FULLY DYNAMIC ALGORITHMS;

ALGORITHMS;

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

References (15)