Lower Bounds on Universal Traversal Sequences Based on Chains of Length Five

See this document in CiteSeerX!

Lower Bounds on Universal Traversal Sequences Based on Chains of Length Five (1995) (Make Corrections) (4 citations)
Jonathan BussInformation and Computation

Home/Search Context Related

View or download:
washington.edu/homes/tompa/...cycle5.ps
Cached: PDF PS.gz PS Image Update Help

From: washington.edu/homes/tompa/pap... (more)
(Enter author homepages)

Rate this article:

(best)
Comment on this article

(Enter summary)
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)

Similar documents based on text: More All
0.4: Universal Traversal Sequences with Backtracking - Koucky (2001) (Correct)
0.3: A Time-Space Tradeoff for Undirected Graph.. - Beame, Borodin.. (1997) (Correct)
0.2: Lower Bounds on Universal Traversal Sequences Based on Chains.. - Buss, Tompa (1995) (Correct)

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
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
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