On the Power of Tree-Depth for Fully Polynomial FPT Algorithms (Q3304140): Difference between revisions

@@ label / en / label / en @@
+On the Power of Tree-Depth for Fully Polynomial FPT Algorithms
@@ Property / DOI @@
-.4230/LIPIcs.STACS.2018.41
@@ Property / DOI: 10.4230/LIPIcs.STACS.2018.41 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.04376
@@ Property / arXiv ID: 1710.04376 / rank @@
+Normal rank
@@ Property / cites work @@
+Subcubic Equivalences Between Graph Centrality Problems, APSP and Diameter
+Normal rank
@@ Property / cites work @@
+Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs
+Normal rank
@@ Property / cites work @@
+Q4038720
@@ Property / cites work: Q4038720 / rank @@
+Normal rank
@@ Property / cites work @@
+Rankings of Graphs
@@ Property / cites work: Rankings of Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Shortest paths in digraphs of small treewidth. I: Sequential algorithms
+Normal rank
@@ Property / cites work @@
+Reachability and Distance Queries via 2-Hop Labels
+Normal rank
@@ Property / cites work @@
+Paths, Trees, and Flowers
@@ Property / cites work: Paths, Trees, and Flowers / rank @@
+Normal rank
@@ Property / cites work @@
+Fully polynomial-time parameterized computations for graphs and matrices of low treewidth
+Normal rank
@@ Property / cites work @@
+Q3138921
@@ Property / cites work: Q3138921 / rank @@
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm for a special case of disjoint set union
+Normal rank
@@ Property / cites work @@
+Faster scaling algorithms for general graph matching problems
+Normal rank
@@ Property / cites work @@
+Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs
+Normal rank
@@ Property / cites work @@
+Improved algorithms for the \(k\) simple shortest paths and the replacement paths problems
+Normal rank
@@ Property / cites work @@
+On the difficulty of some shortest path problems
@@ Property / cites work: On the difficulty of some shortest path problems / rank @@
+Normal rank
@@ Property / cites work @@
+Finding the Hidden Path: Time Bounds for All-Pairs Shortest Paths
+Normal rank
@@ Property / cites work @@
+Ordered colourings
@@ Property / cites work: Ordered colourings / rank @@
+Normal rank
@@ Property / cites work @@
+Applications of a Planar Separator Theorem
@@ Property / cites work: Applications of a Planar Separator Theorem / rank @@
+Normal rank
@@ Property / cites work @@
+The k most vital arcs in the shortest path problem
+Normal rank
@@ Property / cites work @@
+Sparsity. Graphs, structures, and algorithms
@@ Property / cites work: Sparsity. Graphs, structures, and algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Tree-depth, subgraph coloring and homomorphism bounds
+Normal rank
@@ Property / cites work @@
+An <i>O</i>(<i>nm</i>) time algorithm for finding the min length directed cycle in a graph
+Normal rank
@@ Property / cites work @@
+Computing All-Pairs Shortest Paths by Leveraging Low Treewidth
+Normal rank
@@ Property / cites work @@
+Replacement paths and             <i>k</i>             simple shortest paths in unweighted directed graphs
+Normal rank
@@ Property / cites work @@
+Optimal node ranking of tree in linear time
@@ Property / cites work: Optimal node ranking of tree in linear time / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Polyhedra and efficiency (3 volumes)
+Normal rank
@@ Property / cites work @@
+A theory of alternating paths and blossoms for proving correctness of the \(O(\sqrt{V}E)\) general graph maximum matching algorithm
+Normal rank
@@ Property / OpenAlex ID @@
+W2963360194
@@ Property / OpenAlex ID: W2963360194 / rank @@
+Normal rank
@@ Property / title @@
+On the Power of Tree-Depth for Fully Polynomial FPT Algorithms (English)
+Normal rank
@@ Property / DOI @@
+.4230/LIPICS.STACS.2018.41
@@ Property / DOI: 10.4230/LIPICS.STACS.2018.41 / rank @@
+Normal rank