Finding paths and deleting edges in directed acyclic graphs

Information Processing Letters

Volumn 28, Issue 1, 1988, Pages 5-11

  Italiano, Giuseppe F ^a  

^a Department of Computer Science Columbia University ^*  (United States)

Author keywords

Analysis of algorithms; computational complexity; data structure

Indexed keywords

DATA PROCESSING - DATA STRUCTURES; MATHEMATICAL TECHNIQUES - GRAPH THEORY;

ANALYSIS OF ALGORITHMS; COMPUTATIONAL COMPLEXITY; DIRECTED ACYCLIC GRAPHS; EDGE DELETION; GRAPH ALGORITHMS; PATH FINDING;

COMPUTER PROGRAMMING;

EID: 0024017283     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(88)90136-6     Document Type: Article

References (18)

1. On-line computation of minimal and maximal length paths
2. Updating distances in dynamic graphs
3. An On-Line Edge-Deletion Problem
4. Data structures for on-line updating of minimum spanning trees with applications
5. On-line computation of transitive closure for graphs
6. Transitive closure for dynamic graphs
7. Amortized efficiency of a path retrieval data structure
8. Maintenance of Transitive Closures and Transitive Reductions of Graphs
9. A dynamization of the all pairs least cost path problem
10. An O(nm log n) Algorithm for Maximum Network Flow
11. A data structure for dynamic trees
12. A Dynamic Data Structure for Planar Graph Embedding
13. Amortized Computational Complexity
14. Worst-case analysis of set union algorithms
15. The nearest common ancestor in a dynamic tree