The jogger's problem

DOI10.1016/0020-0190(81)90122-8MaRDI QIDQ593786zbMATH OpenOpenAlexFDO

Authors Richard S. Bird

Publication date 1981

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(81)90122-8

zbMATH Keywords

graph algorithmsminimum total costsimple cycle

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Cites work

• scientific article; zbMATH DE number 3481857 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Finding a Minimum Circuit in a Graph

This page was built for publication: The jogger's problem

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