PACE Solver Description: Tree Depth with FlowCutter

DOI10.4230/LIPICS.IPEC.2020.32MaRDI QIDQ6089681zbMATH OpenOpenAlexFDO

Authors Ben Strasser

Publication date 13 November 2023

Full work available at URL https://drops.dagstuhl.de/opus/volltexte/2020/13335/pdf/LIPIcs-IPEC-2020-32.pdf/

zbMATH Keywords

graph algorithmpartitioningtree depth

Mathematics Subject Classification ID

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

Cites work

• Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks
• Customizable contraction hierarchies
• Graph bisection with Pareto optimization
• Graph bisection with Pareto-optimization
• Nested Dissection of a Regular Finite Element Mesh
• Optimal node ranking of tree in linear time
• The elimination form of the inverse and its application to linear programming
• The Evolution of the Minimum Degree Ordering Algorithm

Cited in

(2)

• The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth.
• The parameter report: an orientation guide for data-driven parameterization

This page was built for publication: PACE Solver Description: Tree Depth with FlowCutter

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