Pages that link to "Item:Q2547483"
From MaRDI portal
The following pages link to Efficient determination of the transitive closure of a directed graph (Q2547483):
Displayed 39 items.
- Eccentricity, center and radius computations on the cover graphs of distributive lattices with applications to stable matchings (Q266919) (← links)
- Improving quantum query complexity of Boolean matrix multiplication using graph collision (Q334915) (← links)
- On making directed graphs transitive (Q414917) (← links)
- Finding strong bridges and strong articulation points in linear time (Q443716) (← links)
- Limitations of incremental dynamic programming (Q517805) (← links)
- Thick 2D relations for document understanding (Q558037) (← links)
- All-pairs bottleneck paths in vertex weighted graphs (Q633850) (← links)
- A fast output-sensitive algorithm for Boolean matrix multiplication (Q634680) (← links)
- Bit complexity of matrix products (Q808706) (← links)
- Dynamic shortest paths and transitive closure: algorithmic techniques and data structures (Q849628) (← links)
- All-pairs disjoint paths from a common ancestor in \(\widetilde O (n^\omega)\) time (Q924140) (← 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)
- On the vector representation of the reachability in planar directed graphs (Q1215513) (← links)
- Computational experiences with some transitive closure algorithms (Q1229720) (← links)
- An improved combinatorial algorithm for Boolean matrix multiplication (Q1640996) (← links)
- An improved transitive closure algorithm (Q1836309) (← links)
- The complexity of Boolean matrix root computation (Q1884841) (← links)
- Revealed preference theory: an algorithmic outlook (Q1991199) (← links)
- Algebraic methods in the congested clique (Q2010605) (← links)
- A simple approach to nondecreasing paths (Q2203587) (← links)
- Computing a graph's period quadratically by node condensation (Q2559390) (← links)
- A Combinatorial Algorithm for All-Pairs Shortest Paths in Directed Vertex-Weighted Graphs with Applications to Disc Graphs (Q2891383) (← links)
- On Making Directed Graphs Transitive (Q3183483) (← links)
- (Q3304119) (← links)
- A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities (Q3730348) (← links)
- Complexité de problèmes liés aux graphes sans circuit (Q3773334) (← links)
- Applications of graph theory in computer systems (Q4079059) (← links)
- On efficiently computing the product of two binary relations (Q4109192) (← links)
- On pure structure of dynamic systems (Q4130404) (← links)
- Faster All-Pairs Shortest Paths via Circuit Complexity (Q4554074) (← links)
- From Circuit Complexity to Faster All-Pairs Shortest Paths (Q5009891) (← links)
- (Q5091170) (← links)
- (Q5743491) (← links)
- Distributed Approximation Algorithms for Steiner Tree in the CONGESTED CLIQUE (Q5859656) (← links)
- Elastic-Degenerate String Matching via Fast Matrix Multiplication (Q5864665) (← links)
- Skew-polynomial-sparse matrix multiplication (Q6051113) (← links)
- An output-sensitive algorithm for all-pairs shortest paths in directed acyclic graphs (Q6102272) (← links)
- Fine-Grained Complexity of Regular Path Queries (Q6137832) (← links)