Jonathan Buss  Home/Search
Context Related
Links: ACM DBLP | washington.edu/homes/tompa/...cycle5.ps Cached: PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PS.gz PS Image Update HelpFrom: washington.edu/homes/tompa/pap... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Universal traversal sequences for cycles require length\Omega# n 1:43 ), improving the previous bound of \Omega# n 1:33 ). For d 3, universal traversal sequences for d-regular graphs require length \Omega# d 0:57 n 2:43 ). For constant d, the best previous bound was \Omega# n 2:33 ). 3 1. Reflecting and Universal Traversal Sequences Universal traversal sequences were introduced by Cook (see Aleliunas et al. [2]) as a particularly simple method for traversing graphs.... (Update)
Context of citations to this paper: More
.... sequence (Aleliunas et al. 2] Alon et al. 3] Bar Noy et al. 4] Borodin, Ruzzo, and Tompa [18] Bridgland [19] Buss and Tompa [21], Istrail [34] Karloff et al. 37] Tompa [49] A result of Borodin, Ruzzo, and Tompa [18] shows that such an automaton requires...
.... sequence (Aleliunas et al. 2] Alon et al. 3] Bar Noy et al. 4] Borodin, Ruzzo, and Tompa [16] Bridgland [17] Buss and Tompa [19], Istrail [25] Karloff et al. 26] Tompa [33] A result of Borodin, Ruzzo, and Tompa [16] shows that such an automaton requires )...
Cited by: More
Tree Exploration with Little Memory - Krzysztof Diks Pierre (2002) (Correct)
A Time-Space Tradeoff for Undirected Graph.. - Beame, Borodin.. (1997) (Correct)
Time-Space Tradeoffs for Undirected Graph.. - Beame, Borodin.. (1997) (Correct)
Similar documents (at the sentence level):
33.8%: Lower Bounds on Universal Traversal Sequences Based on Chains.. - Buss, Tompa (1995) (Correct)
18.6%: Lower Bounds On Universal Traversal Sequences For Cycles And.. - Martin Tom Pa (Correct)
Active bibliography (related documents): More All
0.3: Lower Bounds for t-Reflecting Sequences: A Computational Approach - Flannery Dai (Correct)
0.3: Time-Space Tradeoffs for Undirected Graph Traversal - Beame, Borodin, Raghavan.. (1993) (Correct)
0.3: Universal Traversal Sequences with Backtracking - Koucky (2001) (Correct)
Similar documents based on text: More All
0.2: A Sublinear Space, Polynomial Time Algorithm for Directed - Connectivity Greg Barnes (Correct)
0.2: Communication-Space Tradeoffs For Unrestricted Protocols - Beame, Tompa, Yan (1994) (Correct)
0.2: Construction of Optimal Quality Control for Oligo Arrays - Colbourn, Ling, Tompa (Correct)
Related documents from co-citation: More All
4: Universal traversal sequences for paths and cycles (context) - Bridgland - 1987
4: Polynomial universal traversing sequences for cycles are constructible (context) - Istrail - 1988
4: Time-space tradeoffs for undirected graph traversal - Beame, Borodin et al. - 1990
BibTeX entry: (Update)
J. Buss and M. Tompa. Lower bounds on universal traversal sequences based on chains of length five. Information and Computation, 120(2):326--329, Aug. 1995. http://citeseer.ist.psu.edu/buss95lower.html More
@article{ buss95lower,
author = "Jonathan F. Buss and Martin Tompa",
title = "Lower Bounds on Universal Traversal Sequences Based on Chains of Length Five",
journal = "Information and Computation",
volume = "120",
number = "2",
pages = "326-329",
year = "1995",
url = "citeseer.ist.psu.edu/buss95lower.html" }
Citations (may not include all citations):68 The electrical resistance of a graph captures its commute an.. - Chandra, Raghavan et al. - 1989 ACM DBLP
65 universal traversal sequences (context) - Aleliunas, Karp et al. - 1979
20 the cover time of random walks on graphs (context) - Kahn, Linial et al. - 1989
14 Lower bounds on the length of universal traversal sequences (context) - Borodin, Ruzzo et al. - 1992
11 Universal sequences for complete graphs (context) - Alon, Azar et al. - 1990
9 Lower bounds on universal traversal sequences for cycles and.. (context) - Tompa - 1992 ACM DBLP
5 A simple graph traversing problem (context) - Aleliunas - 1978
Documents on the same site (http://www.cs.washington.edu/homes/tompa/papers/): More
An Exact Method for Finding Short Motifs in Sequences, with.. - Tompa (1999) (Correct)
A Linear Time Algorithm for Finding All Maximal Scoring.. - Ruzzo, Tompa (1999) (Correct)
Communication-Space Tradeoffs For Unrestricted Protocols - Beame, Tompa, Yan (1994) (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