The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth.

DOI10.4230/LIPICS.IPEC.2020.37OpenAlexW3117577989MaRDI QIDQ6089686FDOQ6089686

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

zbMATH Keywords

contestFPTimplementation challengecomputing treedepth

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68Wxx) Parameterized complexity, tractability and kernelization (68Q27)

Cites Work

• The Evolution of the Minimum Degree Ordering Algorithm
• Nested Dissection of a Regular Finite Element Mesh
• Tree-depth, subgraph coloring and homomorphism bounds
• Graph minors. II. Algorithmic aspects of tree-width
• Sparsity. Graphs, structures, and algorithms
• Optimal node ranking of tree in linear time
• GENERATING ALL THE MINIMAL SEPARATORS OF A GRAPH
• Space-optimal, backtracking algorithms to list the minimal vertex separators of a graph
• Treedepth Parameterized by Vertex Cover Number.
• On the vertex ranking problem for trapezoid, circular-arc and other graphs
• On low tree-depth decompositions
• A Faster Parameterized Algorithm for Treedepth
• Positive-instance driven dynamic programming for treewidth
• Title not available (Why is that?)
• The PACE 2019 Parameterized Algorithms and Computational Experiments Challenge: The Fourth Iteration (Invited Paper)
• Graph Bisection with Pareto Optimization
• SAT-Encodings for Treecut Width and Treedepth
• Title not available (Why is that?)
• Title not available (Why is that?)
• Positive-Instance Driven Dynamic Programming for Treewidth.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• PACE Solver Description: Tree Depth with FlowCutter
• PACE Solver Description: Finding Elimination Trees Using ExTREEm - a Heuristic Solver for the Treedepth Decomposition Problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (2)

• On the size of minimal separators for treedepth decomposition
• Efficient interprocedural data-flow analysis using treedepth and treewidth

This page was built for publication: The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6089686)