scientific article; zbMATH DE number 7651159

DOI10.4230/LIPICS.ESA.2020.20MaRDI QIDQ5874487FDOQ5874487

Authors: Johannes Blum, Sabine Storandt 

Publication date: 7 February 2023

Title of this publication is not available (Why is that?)

zbMATH Keywords

tree decompositioncontraction hierarchiessearch space sizebalanced separator

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

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