scientific article; zbMATH DE number 7651159

DOI10.4230/LIPICS.ESA.2020.20MaRDI QIDQ5874487zbMATH OpenFDO

Authors Johannes Blum, Sabine Storandt

Publication date 7 February 2023

Full work available at URL https://doi.org/10.4230/LIPICS.ESA.2020.20

zbMATH Keywords

tree decompositioncontraction hierarchiessearch space sizebalanced separator

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• scientific article; zbMATH DE number 554763 (Why is no real title available?)
• Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
• Beyond highway dimension: small distance labels using tree skeletons
• Constant factor approximation of vertex-cuts in planar graphs
• Customizable contraction hierarchies
• Directed tree-width
• Highway dimension, shortest paths, and provably efficient algorithms
• Lower bounds in the preprocessing and query phases of routing algorithms
• On the Problem of Partitioning Planar Graphs
• Optimal node ranking of tree in linear time
• Preprocessing speed-up techniques is hard
• Provable efficiency of contraction hierarchies with randomized preprocessing
• Reachability and Distance Queries via 2-Hop Labels
• Search-space size in contraction hierarchies
• Search-space size in contraction hierarchies

Cited in

(2)

• Customizable hub labeling: properties and algorithms
• Fission: Practical algorithms for computing minimum balanced node separators

This page was built for publication:

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