N. Alon, Y. Azar, and Y. Ravid, Universal sequences for complete graphs, Discrete Applied Mathematics, 27:25-28, 1990. Home/Search Document Not in Database Context Related Articles Check |
This paper is cited by the following papers:
Tree Exploration with Little Memory - Krzysztof Diks Pierre (2002) (Correct)
A Time-Space Tradeoff for Undirected Graph.. - Beame, Borodin.. (1997) (5 citations) (Correct)
Universal Traversal Sequences with Backtracking - Koucky (2001) (Correct)
Lower Bounds On Universal Traversal Sequences For Cycles And.. - Martin Tom Pa (Correct)
Lower Bounds on Universal Traversal Sequences Based on Chains of.. - Buss (1995) (2 citations) (Correct)
Time-Space Tradeoffs for Graph s-t Connectivity - Barnes (1992) (Correct)
Lower Bounds on Universal Traversal Sequences Based on Chains.. - Buss, Tompa (1995) (2 citations) (Correct)
Time-Space Tradeoffs for Undirected Graph.. - Beame, Borodin.. (1997) (5 citations) (Correct)
Deterministic Algorithms for Undirected s-t Connectivity Using .. - Barnes, Ruzzo (1991) (1 citation) (Correct)
Time-Space Tradeoffs for Undirected Graph Traversal - Beame, Borodin, Raghavan.. (1993) (5 citations) (Correct)
Tree Exploration with Little Memory - Krzysztof Diks Pierre (2002) (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