Graph Bisection with Pareto-Optimization

DOI10.1137/1.9781611974317.8zbMath1430.68431OpenAlexW2790553629MaRDI QIDQ5232549

Michael Hamann, Ben Strasser

Publication date: 12 September 2019

Published in: 2016 Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611974317.8

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (5)

Graph Bisection with Pareto Optimization ⋮ A heuristic approach to the treedepth decomposition problem for large graphs ⋮ PACE Solver Description: Tree Depth with FlowCutter ⋮ PACE Solver Description: Finding Elimination Trees Using ExTREEm - a Heuristic Solver for the Treedepth Decomposition Problem ⋮ Customizable Contraction Hierarchies

This page was built for publication: Graph Bisection with Pareto-Optimization