Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

The jogger's problem

From MaRDI portal
Publication:593786
Jump to:navigation, search

DOI10.1016/0020-0190(81)90122-8zbMath0525.68044OpenAlexW1977902141MaRDI QIDQ593786

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) Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38)





Cites Work

  • Finding a Minimum Circuit in a Graph
  • Unnamed Item
  • Unnamed Item




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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:593786&oldid=12479924"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 30 January 2024, at 07:41.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki