On the complexity of partitioning graphs for arc-flags

DOI10.7155/JGAA.00294MaRDI QIDQ2838234zbMATH OpenOpenAlexFDO

Authors Reinhard Bauer, Moritz Baum, Ignaz Rutter, Dorothea Wagner

Publication date 9 July 2013

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

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

approximation algorithmsarc-flags algorithmcyclesoptimal partitionspartition of a graphprecomputation of auxiliary datasearch-space sizeshortest path queriestrees

Mathematics Subject Classification ID

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

Recommendations

• On the complexity of partitioning graphs for arc-flags
• Partitioning graphs to speedup Dijkstra's algorithm
• scientific article; zbMATH DE number 5734722
• Arc-flags in dynamic graphs
• Experimental and Efficient Algorithms

Cited in

(1)

• On the complexity of partitioning graphs for arc-flags

This page was built for publication: On the complexity of partitioning graphs for arc-flags

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