Partitioning de Bruijn graphs into fixed-length cycles for robot identification and tracking

DOI10.1016/j.dam.2016.05.013zbMath1344.05114arXiv1502.02199OpenAlexW2145472417MaRDI QIDQ313805

Tony Grubman, David R. Wood, Y. Ahmet Şekercioğlu

Publication date: 12 September 2016

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1502.02199

zbMATH Keywords

de Bruijn graphpose estimationgraph decompositionlinear feedback shift registerrobot network

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Artificial intelligence for robotics (68T40)

Cites Work

• A solution of Dudeney's round table problem for an even number of people
• Cycle decomposition by disjoint transpositions
• Asymptotic lower bounds for Ramsey functions
• Cycle decompositions. IV: Complete directed graphs and fixed length directed cycles
• Resolvable coverings of 2-paths by cycles
• The combinatorial power of the companion matrix
• A proof of Golomb's conjecture for the de Bruijn graph
• A Survey of Combinatorial Gray Codes
• A Gray Code for Necklaces of Fixed Density
• Cycle decompositions V: Complete graphs into cycles of arbitrary lengths
• Rigid graph control architectures for autonomous formations
• The lexicographically least de Bruijn cycle
• Normal Recurring Decimals
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Partitioning de Bruijn graphs into fixed-length cycles for robot identification and tracking