The following pages link to (Q5365129):
Displaying 7 items.
- Mining preserving structures in a graph sequence (Q344786) (← links)
- An efficient strongly connected components algorithm in the fault tolerant model (Q666658) (← links)
- An improved algorithm for transitive closure on acyclic digraphs (Q1110330) (← links)
- Speeding up dynamic transitive closure for bounded degree graphs (Q1323330) (← links)
- A fully dynamic reachability algorithm for directed graphs with an almost linear update time (Q2810272) (← links)
- Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition (Q3189650) (← links)
- Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths (Q5899451) (← links)
