Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2002, Pages 117-123

  Baswana, Surender ^a   Sen, Sandeep ^a   Hariharan, Ramesh ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY DELHI   (India)

Author keywords

BFS tree; Dynamic; Graph; Shortest path; Transitive closure

Indexed keywords

COMPUTER SCIENCE; ERROR ANALYSIS; GRAPH THEORY; PROBABILITY; RANDOM PROCESSES;

IMPROVED DECREMENTAL ALGORITHMS; TRANSITIVE CLOSURE;

ALGORITHMS;

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

References (11)

1. Filtering search: A new approach to query-answering
2. Matrix multiplication via arithmetic progressions
3. 2) barrier
4. Fully dynamic all pairs shortest paths with real edge weights
5. Fully dynamic bi-connectivity and transitive closure
6. Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs
7. A space saving trick for directed dynamic transitive closure and shortest path algorithms
8. Maintenance of transitive closure and transitive reduction of a graph
9. All-pairs shortest paths in weighted directed graphs - Exact and almost exact algorithms