An O\((n\log n)\) algorithm for the zoo-keeper's problem (Q1869741): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 06:00, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An O\((n\log n)\) algorithm for the zoo-keeper's problem |
scientific article |
Statements
An O\((n\log n)\) algorithm for the zoo-keeper's problem (English)
0 references
28 April 2003
0 references
shortest paths
0 references
zoo-keeper's problem
0 references
floodlight tree
0 references