On the negative cost girth problem in planar networks

DOI10.1016/j.jda.2015.10.001zbMath1343.05144MaRDI QIDQ891820

Matthew Williamson, K. Subramani and Vahan Mkrtchyan

Publication date: 17 November 2015

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2015.10.001

zbMATH Keywords

relaxation; girth; divide and conquer; negative cost cycle detection; planar networks

Mathematics Subject Classification ID

05C82: Small world graphs, complex networks (graph-theoretic aspects)

05C10: Planar graphs; geometric and topological aspects of graph theory

05C85: Graph algorithms (graph-theoretic aspects)