Improved length lower bounds for reflecting sequences

DOI10.1007/3-540-61332-3_139zbMath1529.68203OpenAlexW14905575MaRDI QIDQ6142892

Kevin E. Flannery, H. K. Dai

Publication date: 29 January 2024

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61332-3_139

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• On the cover time of random walks on graphs
• Bounds on Universal Sequences
• Space Lower Bounds for Maze Threadability on Restricted Machines

This page was built for publication: Improved length lower bounds for reflecting sequences