Pages that link to "Item:Q1323330"

The following pages link to Speeding up dynamic transitive closure for bounded degree graphs (Q1323330):

Displaying 16 items.

• Maintaining transitive closure in first order after node-set and edge-set deletions (Q287062) (← links)
• Updating \(\leqslant, <\)-chains (Q294886) (← links)
• On making directed graphs transitive (Q414917) (← 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 efficient algorithm for the transitive closure and a linear worst-case complexity result for a class of sparse graphs (Q1075771) (← links)
• NC algorithms for dynamically solving the all pairs shortest paths problem and related problems (Q1350623) (← links)
• Maintaining a topological order under edge insertions (Q1847369) (← links)
• Dynamic maintenance of the transitive closure in disjunctive graphs (Q1924722) (← links)
• A note on the fast computation of transitive closure of graphs and the multiplication of integer matrices (Q2027889) (← links)
• A fully polynomial parameterized algorithm for counting the number of reachable vertices in a digraph (Q2032176) (← links)
• A note on the complexity of computing the number of reachable vertices in a digraph (Q2629773) (← links)
• (Q5365129) (← links)
• A fully dynamic algorithm for maintaining the transitive closure (Q5917499) (← links)
• Fully Dynamic Transitive Closure in plane dags with one source and one sink (Q6102301) (← links)
• Verified first-order monitoring with recursive rules (Q6535617) (← links)