Pages that link to "Item:Q5269373"
From MaRDI portal
The following pages link to An Experimental Study of Dynamic Algorithms for Transitive Closure (Q5269373):
Displaying 14 items.
- An efficient strongly connected components algorithm in the fault tolerant model (Q666658) (← links)
- Computing transitive closure on systolic arrays of fixed size (Q808290) (← links)
- Dynamic shortest paths and transitive closure: algorithmic techniques and data structures (Q849628) (← links)
- Mantaining dynamic matrices for fully dynamic transitive closure (Q930605) (← links)
- An improved algorithm for transitive closure on acyclic digraphs (Q1110330) (← links)
- Speeding up dynamic transitive closure for bounded degree graphs (Q1323330) (← links)
- Incremental and decremental evaluation of transitive closure by first- order queries (Q1898482) (← links)
- Efficient computation of transitive closures (Q2639033) (← links)
- A fully dynamic reachability algorithm for directed graphs with an almost linear update time (Q2810272) (← links)
- An optimal constraint programming approach to the open-shop problem (Q2815442) (← links)
- (Q4211738) (← links)
- (Q4471323) (← links)
- A faster and simpler fully dynamic transitive closure (Q4962698) (← links)
- Decremental Strongly Connected Components and Single-Source Reachability in Near-Linear Time (Q5020731) (← links)