Pages that link to "Item:Q3455533"

The following pages link to All pairs shortest paths using bridging sets and rectangular matrix multiplication (Q3455533):

Displaying 50 items.

• A distributed enumeration algorithm and applications to all pairs shortest paths, diameter\dots (Q259059) (← links)
• New analysis and computational study for the planar connected dominating set problem (Q328712) (← links)
• An \(O(n^3 \log \log n / \log^2 n)\) time algorithm for all pairs shortest paths (Q350723) (← links)
• Approximate shortest paths in weighted graphs (Q414929) (← links)
• On minimum witnesses for Boolean matrix multiplication (Q517804) (← links)
• On bounded leg shortest paths problems (Q633848) (← links)
• All-pairs bottleneck paths in vertex weighted graphs (Q633850) (← links)
• Average update times for fully-dynamic all-pairs shortest paths (Q643013) (← links)
• Incremental distance products via faulty shortest paths (Q783710) (← 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)
• An \(O(n^{3}(\log\log n /\log n )^{5/4})\) time algorithm for all pairs shortest path (Q930607) (← links)
• All-pairs nearly 2-approximate shortest paths in \(O(n^2 \text{ polylog } n)\) time (Q1001904) (← links)
• Computational study on planar dominating set problem (Q1040587) (← links)
• A universal concept for robust solving of shortest path problems in dynamically reconfigurable graphs (Q1665401) (← links)
• Two bilinear \((3\times3)\)-matrix multiplication algorithms of complexity 25 (Q1789204) (← links)
• Extreme witnesses and their applications (Q1799232) (← links)
• A new approach to all-pairs shortest paths on real-weighted graphs (Q1884872) (← links)
• A shortest cycle for each vertex of a graph (Q1944201) (← links)
• Small normalized circuits for semi-disjoint bilinear forms require logarithmic and-depth (Q1989349) (← links)
• Algebraic methods in the congested clique (Q2010605) (← links)
• Improved distance sensitivity oracles with subcubic preprocessing time (Q2237898) (← links)
• Approximating the minimum cycle mean (Q2253203) (← links)
• Improved distance queries and cycle counting by Frobenius normal form (Q2321929) (← links)
• Vertex labeling and routing for Farey-type symmetrically-structured graphs (Q2333775) (← links)
• Variations on the bottleneck paths problem (Q2339446) (← links)
• Faster algorithms for finding lowest common ancestors in directed acyclic graphs (Q2373733) (← links)
• Multi-agent differential graphical games: online adaptive learning solution for synchronization with optimality (Q2391448) (← links)
• Algebraic theory on shortest paths for all flows (Q2424883) (← links)
• Faster algorithms for all-pairs small stretch distances in weighted graphs (Q2429342) (← links)
• All-pairs shortest paths with real weights in \(O ( n^{3}/\log n )\) time (Q2480908) (← links)
• Fully dynamic all pairs shortest paths with real edge weights (Q2496318) (← links)
• A new algorithm for optimal 2-constraint satisfaction and its implications (Q2581276) (← links)
• A survey of the all-pairs shortest paths problem and its variants in graphs (Q2629565) (← links)
• Dynamic Approximate All-Pairs Shortest Paths: Breaking the $O(mn)$ Barrier and Derandomization (Q2816298) (← links)
• An Experimental Study on Approximating <i>k</i> Shortest Simple Paths (Q2828199) (← links)
• Algorithmic Techniques for Maintaining Shortest Routes in Dynamic Networks (Q2864176) (← links)
• A Combinatorial Algorithm for All-Pairs Shortest Paths in Directed Vertex-Weighted Graphs with Applications to Disc Graphs (Q2891383) (← links)
• Minimum Weight Polygon Triangulation Problem in Sub-Cubic Time Bound (Q2958326) (← links)
• Towards an Almost Quadratic Lower Bound on the Monotone Circuit Complexity of the Boolean Convolution (Q2988838) (← links)
• Bounds for Semi-disjoint Bilinear Forms in a Unit-Cost Computational Model (Q2988839) (← links)
• A Task-Scheduling Approach for Efficient Sparse Symmetric Matrix-Vector Multiplication on a GPU (Q3454464) (← links)
• Extreme Witnesses and Their Applications (Q3467863) (← links)
• Approximating Shortest Paths in Graphs (Q3605483) (← links)
• Faster All-Pairs Shortest Paths via Circuit Complexity (Q4554074) (← links)
• Matching Triangles and Basing Hardness on an Extremely Popular Conjecture (Q4571929) (← links)
• Fast matrix multiplication and its algebraic neighbourhood (Q4610195) (← links)
• Truly Subcubic Algorithms for Language Edit Distance and RNA Folding via Fast Bounded-Difference Min-Plus Product (Q4634027) (← links)
• A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths (Q4997313) (← links)
• Improved Time Bounds for All Pairs Non-decreasing Paths in General Digraphs (Q5002719) (← links)