M. Tompa. Lower bounds on universal traversal sequences for cycles and other low degree graphs. SIAM Journal on Computing, 21(6):1153--1160, Dec. 1992. 25  Home/Search Document Not in Database Context Related Articles Check |
This paper is cited by the following papers:
Time-Space Tradeoffs for Graph s-t Connectivity - Barnes (1992) (Correct)
Cubic Graphs - Greenlaw, Petreschi (1995) (12 citations) (Correct)
Lower Bounds for t-Reflecting Sequences: A Computational Approach - Flannery Dai (Correct)
Deterministic Algorithms for Undirected s-t Connectivity Using .. - Barnes, Ruzzo (1991) (1 citation) (Correct)
A Time-Space Tradeoff for Undirected Graph.. - Beame, Borodin.. (1997) (5 citations) Self-citation (Tompa) (Correct)
Lower Bounds on Universal Traversal Sequences Based on Chains of.. - Buss (1995) (2 citations) Self-citation (Tompa) (Correct)
Lower Bounds on Universal Traversal Sequences Based on Chains.. - Buss, Tompa (1995) (2 citations) Self-citation (Tompa) (Correct)
Time-Space Tradeoffs for Undirected Graph.. - Beame, Borodin.. (1997) (5 citations) Self-citation (Tompa) (Correct)
Time-Space Tradeoffs for Undirected Graph Traversal - Beame, Borodin, Raghavan.. (1993) (5 citations) Self-citation (Tompa) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC