Document Open Access Logo

PACE Solver Description: Tree Depth with FlowCutter

Author Ben Strasser

PDF

File

Thumbnail PDF
PDF
LIPIcs.IPEC.2020.32.pdf
  • Filesize: 282 kB
  • 4 pages

Document Identifiers

Subject Classification

ACM Subject Classification
  • Theory of computation → Graph algorithms analysis
Keywords
  • tree depth
  • graph algorithm
  • partitioning

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

We describe the FlowCutter submission to the PACE 2020 heuristic tree-depth challenge. The task of the challenge consists of computing an elimination tree of small height for a given graph. At its core our submission uses a nested dissection approach, with FlowCutter as graph bisection algorithm.

Cite As Get BibTex

Ben Strasser. PACE Solver Description: Tree Depth with FlowCutter. In 15th International Symposium on Parameterized and Exact Computation (IPEC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 180, pp. 32:1-32:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020) https://doi.org/10.4230/LIPIcs.IPEC.2020.32

Author Details

Ben Strasser
  • Independent Researcher, Germany

Acknowledgements

We thank the organizers for their work in making the 2020 PACE challenge a success.

Supplementary Materials

References

  1. Julian Dibbelt, Ben Strasser, and Dorothea Wagner. Customizable contraction hierarchies. In Symposium Experimental Algorithms SEA 2014, volume 8504, pages 271-282. Springer, 2014. URL: https://doi.org/10.1007/978-3-319-07959-2_23.
  2. Julian Dibbelt, Ben Strasser, and Dorothea Wagner. Customizable contraction hierarchies. ACM Journal of Experimental Algorithmics JEA, 21(1):1.5:1-1.5:49, 2016. URL: https://doi.org/10.1145/2886843.
  3. Robert Geisberger, Peter Sanders, Dominik Schultes, and Daniel Delling. Contraction hierarchies: Faster and simpler hierarchical routing in road networks. In Workshop on Experimental Algorithms, WEA 2008, volume 5038, pages 319-333. Springer, 2008. URL: https://doi.org/10.1007/978-3-540-68552-4_24.
  4. Alan George. Nested dissection of a regular finite element mesh. SIAM Journal on Numerical Analysis, 10(2):345-363, 1973. Google Scholar
  5. Alan George and Joseph WH Liu. The evolution of the minimum degree ordering algorithm. Siam review, 31(1):1-19, 1989. Google Scholar
  6. Michael Hamann and Ben Strasser. Graph bisection with pareto-optimization. In Michael T. Goodrich and Michael Mitzenmacher, editors, Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments, ALENEX 2016, Arlington, Virginia, USA, January 10, 2016, pages 90-102. SIAM, 2016. URL: https://doi.org/10.1137/1.9781611974317.8.
  7. Michael Hamann and Ben Strasser. Graph bisection with pareto optimization. ACM Journal of Experimental Algorithmics JEA, 23, 2018. URL: https://doi.org/10.1145/3173045.
  8. Michael Hamann and Ben Strasser. Correspondence between multilevel graph partitions and tree decompositions. Algorithms, 12(9):198, 2019. URL: https://doi.org/10.3390/a12090198.
  9. Harry M Markowitz. The elimination form of the inverse and its application to linear programming. Management Science, 3(3):255-269, 1957. Google Scholar
  10. Usha Nandini Raghavan, Réka Albert, and Soundar Kumara. Near linear time algorithm to detect community structures in large-scale networks. Physical review E, 76(3):036106, 2007. Google Scholar
  11. Alejandro A. Schäffer. Optimal node ranking of trees in linear time. Inf. Process. Lett., 33(2):91-96, 1989. URL: https://doi.org/10.1016/0020-0190(89)90161-0.
  12. Ben Strasser. Computing tree decompositions with flowcutter: PACE 2017 submission. CoRR, abs/1709.08949, 2017. URL: http://arxiv.org/abs/1709.08949.
  13. Ben Strasser. Flowcutter pace 2020 submission, 2020. URL: https://github.com/ben-strasser/flow-cutter-pace20.
  14. Ben Strasser. Flowcutter pace 2020 submission, 2020. URL: https://doi.org/10.5281/zenodo.3870928.
  15. Ben Strasser and Dorothea Wagner. Graph fill-in, elimination ordering, nested dissection and contraction hierarchies. In Gems of Combinatorial Optimization and Graph Algorithms, pages 69-82. Springer, 2015. URL: https://doi.org/10.1007/978-3-319-24971-1_7.
  16. Sylwester Swat. Extreem source code. URL: https://doi.org/10.5281/zenodo.3873126.
  17. Marcin Wrochna. Sallow: a heuristic algorithm for treedepth decompositions. CoRR, abs/2006.07050, 2020. URL: http://arxiv.org/abs/2006.07050.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact