Minimum Cost Paths in Periodic Graphs

DOI10.1137/S0097539792234378zbMath0839.05063OpenAlexW2054279301MaRDI QIDQ4857594

Egon Wanke, Franz Höfting

Publication date: 9 June 1996

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539792234378

zbMATH Keywords

periodic graphstatic graphminimum cost pathsinfinite homogeneous graph

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Distance in graphs (05C12)

Related Items (3)

Radiocolorings in periodic planar graphs: PSPACE-completeness and efficient approximations for the optimal range of frequencies ⋮ Powers of matrices over an extremal algebra with applications to periodic graphs ⋮ Velocity polytopes of periodic graphs and a no-go theorem for digital physics

This page was built for publication: Minimum Cost Paths in Periodic Graphs