Are there graphs whose shortest path structure requires large edge weights?

DOI10.4230/LIPICS.ITCS.2024.12MaRDI QIDQ6906428zbMATH OpenFDO

Authors Aaron Bernstein, Greg Bodwin, Nicole Wein

Publication date 4 November 2025

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

graph theoryshortest pathsweighted graphs

Mathematics Subject Classification ID

Theory of computing (68Qxx)

This page was built for publication: Are there graphs whose shortest path structure requires large edge weights?

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