On the Complexity of Partitioning Graphs for Arc-Flags

DOI10.7155/jgaa.00294zbMath1267.05243OpenAlexW2114488974MaRDI QIDQ2838234

Ignaz Rutter, Reinhard Bauer, Moritz Baum, Dorothea Wagner

Publication date: 9 July 2013

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7155/jgaa.00294

zbMATH Keywords

cyclestreesapproximation algorithmsoptimal partitionsshortest path queriespartition of a grapharc-flags algorithmprecomputation of auxiliary datasearch-space size

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

This page was built for publication: On the Complexity of Partitioning Graphs for Arc-Flags