A discrete and continuous study of the \textsc{Max-Chain-Formation} problem (Q2672258)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A discrete and continuous study of the \textsc{Max-Chain-Formation} problem |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A discrete and continuous study of the \textsc{Max-Chain-Formation} problem |
scientific article |
Statements
A discrete and continuous study of the \textsc{Max-Chain-Formation} problem (English)
0 references
8 June 2022
0 references
mobile robots
0 references
chain formation
0 references
max-chain formation
0 references
continuous time
0 references
runtime
0 references
0 references
0.9354962
0 references
0 references
0.85618967
0 references
0.8526297
0 references
0.8505615
0 references
0.84934825
0 references
0.8451288
0 references
0.8444543
0 references
0.8425319
0 references
