The jogger's problem (Q593786): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0020-0190(81)90122-8 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1977902141 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4065051 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Finding a Minimum Circuit in a Graph / rank | |||
Normal rank |
Latest revision as of 11:02, 14 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The jogger's problem |
scientific article |
Statements
The jogger's problem (English)
0 references
1981
0 references
graph algorithms
0 references
simple cycle
0 references
minimum total cost
0 references