scientific article; zbMATH DE number 1796968
From MaRDI portal
Publication:4551362
zbMath0991.68515MaRDI QIDQ4551362
Publication date: 5 September 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2108/21080228
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)
Related Items (3)
Universal traversal sequences with backtracking. ⋮ Length lower bounds for reflecting sequences and universal traversal sequences ⋮ Log-space constructible universal traversal sequences for cycles of length O(\(n^{4.03}\)).
This page was built for publication: