PACE Solver Description: Tree Depth with FlowCutter

DOI10.4230/lipics.ipec.2020.32OpenAlexW3114358295MaRDI QIDQ6089681

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

partitioninggraph algorithmtree depth

Mathematics Subject Classification ID

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

Related Items (1)

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

Cites Work

• Optimal node ranking of tree in linear time
• The Elimination form of the Inverse and its Application to Linear Programming
• Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks
• The Evolution of the Minimum Degree Ordering Algorithm
• Graph Bisection with Pareto Optimization
• Graph Bisection with Pareto-Optimization
• Customizable Contraction Hierarchies
• Nested Dissection of a Regular Finite Element Mesh

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