The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth.
From MaRDI portal
Publication:6089686
DOI10.4230/lipics.ipec.2020.37OpenAlexW3117577989MaRDI QIDQ6089686
Marcin Mucha, Manuel Sorge, Łukasz Kowalik, Wojciech Nadara, Marcin Pilipczuk, Piotr Wygocki
Publication date: 13 November 2023
Full work available at URL: https://doi.org/10.4230/LIPIcs.IPEC.2020.37
Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68Wxx) Parameterized complexity, tractability and kernelization (68Q27)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sparsity. Graphs, structures, and algorithms
- Space-optimal, backtracking algorithms to list the minimal vertex separators of a graph
- On low tree-depth decompositions
- Optimal node ranking of tree in linear time
- On the vertex ranking problem for trapezoid, circular-arc and other graphs
- Positive-instance driven dynamic programming for treewidth
- Tree-depth, subgraph coloring and homomorphism bounds
- Graph minors. II. Algorithmic aspects of tree-width
- The Evolution of the Minimum Degree Ordering Algorithm
- Graph Bisection with Pareto Optimization
- Treedepth Parameterized by Vertex Cover Number.
- Positive-Instance Driven Dynamic Programming for Treewidth.
- A Faster Parameterized Algorithm for Treedepth
- SAT-Encodings for Treecut Width and Treedepth
- GENERATING ALL THE MINIMAL SEPARATORS OF A GRAPH
- Nested Dissection of a Regular Finite Element Mesh
- The PACE 2019 Parameterized Algorithms and Computational Experiments Challenge: The Fourth Iteration (Invited Paper)
- PACE Solver Description: Tree Depth with FlowCutter
- PACE Solver Description: Finding Elimination Trees Using ExTREEm - a Heuristic Solver for the Treedepth Decomposition Problem
