Pages that link to "Item:Q1051432"
From MaRDI portal
The following pages link to On-line computation of transitive closures of graphs (Q1051432):
Displaying 16 items.
- Dynamic shortest paths and transitive closure: algorithmic techniques and data structures (Q849628) (← links)
- Mantaining dynamic matrices for fully dynamic transitive closure (Q930605) (← links)
- Dynamic cycle detection (Q1055194) (← links)
- Amortized efficiency of a path retrieval data structure (Q1099629) (← links)
- Finding paths and deleting edges in directed acyclic graphs (Q1115184) (← links)
- A special case the of dynamization problem for least cost paths (Q1183415) (← links)
- On-line computation of minimal and maximal length paths (Q1184981) (← links)
- Speeding up dynamic transitive closure for bounded degree graphs (Q1323330) (← links)
- NC algorithms for dynamically solving the all pairs shortest paths problem and related problems (Q1350623) (← links)
- On-line 2-satisfiability (Q1356216) (← links)
- A data structure for arc insertion and regular path finding (Q1360677) (← links)
- Symbolic state-space exploration and numerical analysis of state-sharing composed models (Q1434418) (← links)
- Nonrecursive incremental evaluation of Datalog queries (Q1924723) (← links)
- Modular materialisation of Datalog programs (Q2144176) (← links)
- Credibility dynamics: a belief-revision-based trust model with pairwise comparisons (Q2238617) (← links)
- A fully dynamic algorithm for maintaining the transitive closure (Q5917499) (← links)