Efficient parameterized algorithms for computing all-pairs shortest paths (Q6069155): Difference between revisions

@@ Property / cites work @@
+Parameterized aspects of triangle enumeration
@@ Property / cites work: Parameterized aspects of triangle enumeration / rank @@
+Normal rank
@@ Property / cites work @@
+Relationships between homogeneity, subadditivity and convexity properties
+Normal rank
@@ Property / cites work @@
+More Algorithms for All-Pairs Shortest Paths in Weighted Graphs
+Normal rank
@@ Property / cites work @@
+Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs
+Normal rank
@@ Property / cites work @@
+Upper bounds to the clique width of graphs
@@ Property / cites work: Upper bounds to the clique width of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Finding a Heaviest Vertex-Weighted Triangle Is not Harder than Matrix Multiplication
+Normal rank
@@ Property / cites work @@
+Optimal centrality computations within bounded clique-width graphs
+Normal rank
@@ Property / cites work @@
+Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth
+Normal rank
@@ Property / cites work @@
+New Bounds on the Complexity of the Shortest Path Problem
+Normal rank
@@ Property / cites work @@
+Transitiv orientierbare Graphen
@@ Property / cites work: Transitiv orientierbare Graphen / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs
+Normal rank
@@ Property / cites work @@
+Directed NLC-width
@@ Property / cites work: Directed NLC-width / rank @@
+Normal rank
@@ Property / cites work @@
+A survey of the algorithmic aspects of modular decomposition
+Normal rank
@@ Property / cites work @@
+An \(O(n^3 \log \log n / \log^2 n)\) time algorithm for all pairs shortest paths
+Normal rank
@@ Property / cites work @@
+Computing Graph Distances Parameterized by Treewidth and Diameter
+Normal rank
@@ Property / cites work @@
+On the Power of Tree-Depth for Fully Polynomial FPT Algorithms
+Normal rank
@@ Property / cites work @@
+Q4489221
@@ Property / cites work: Q4489221 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient and Adaptive Parameterized Algorithms on Modular Decompositions
+Normal rank
@@ Property / cites work @@
+Q5874311
@@ Property / cites work: Q5874311 / rank @@
+Normal rank
@@ Property / cites work @@
+A Combinatorial Algorithm for All-Pairs Shortest Paths in Directed Vertex-Weighted Graphs with Applications to Disc Graphs
+Normal rank
@@ Property / cites work @@
+A new approach to all-pairs shortest paths on real-weighted graphs
+Normal rank
@@ Property / cites work @@
+A Shortest Path Algorithm for Real-Weighted Undirected Graphs
+Normal rank
@@ Property / cites work @@
+All-pairs bottleneck paths in vertex weighted graphs
+Normal rank
@@ Property / cites work @@
+Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
+Normal rank
@@ Property / cites work @@
+\(k\)-NLC graphs and polynomial algorithms
@@ Property / cites work: \(k\)-NLC graphs and polynomial algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+A Theorem on Boolean Matrices
@@ Property / cites work: A Theorem on Boolean Matrices / rank @@
+Normal rank
@@ Property / cites work @@
+Faster All-Pairs Shortest Paths via Circuit Complexity
+Normal rank
@@ Property / cites work @@
+Subcubic Equivalences Between Path, Matrix, and Triangle Problems
+Normal rank
@@ Property / cites work @@
+Q4633908
@@ Property / cites work: Q4633908 / rank @@
+Normal rank