Partitioning de Bruijn graphs into fixed-length cycles for robot identification and tracking (Q313805)
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: Partitioning de Bruijn graphs into fixed-length cycles for robot identification and tracking |
scientific article; zbMATH DE number 6626387
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Partitioning de Bruijn graphs into fixed-length cycles for robot identification and tracking |
scientific article; zbMATH DE number 6626387 |
Statements
Partitioning de Bruijn graphs into fixed-length cycles for robot identification and tracking (English)
0 references
12 September 2016
0 references
robot network
0 references
de Bruijn graph
0 references
graph decomposition
0 references
pose estimation
0 references
linear feedback shift register
0 references
