Proc. ICCI'94, 178-193 1994 Int. Conf. on Computing and Information K. E....  Home/Search
Context
Related
| wi.euvfrankfurto.de/icci94/p...a11.ps viadrina.euvfrankfurto.de/~w...a11.ps Cached: PS.gz PS 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.
Image Update HelpPS.gz PS PDF From: wi.euvfrankfurto.de/icci...absa (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A method is given which is useful in calculating lower bounds on t-reflecting sequences for labeled chains of length n. Our approach is based on M. Tompa's "markto -bit ratio" technique for showing such bounds. The method has shown a lower bound of 17.82t for t-reflecting sequences for 7-chains, thus improving the current lower bound for universal traversal sequences for 2-regular graphs of n vertices from W(n 1.43 ) to W(n 1.48 ), and for UTSs for d-regular graphs of n vertices where... (Update)
Active bibliography (related documents): More All
0.3: Lower Bounds on Universal Traversal Sequences Based on Chains.. - Buss, Tompa (1995) (Correct)
0.3: Time-Space Tradeoffs for Graph s-t Connectivity - Barnes (1992) (Correct)
0.3: Deterministic Algorithms for Undirected s-t Connectivity Using .. - Barnes, Ruzzo (1991) (Correct)
Similar documents based on text: More All
1.4: An Entrepreneurship Minor/cognate For Engineering.. - Schultz, Johnson.. (Correct)
1.4: IEEE November 6 - 9, 2002, Boston, MA - The Airborne Environmental (Correct)
0.2: A Time-Space Tradeoff for Undirected Graph.. - Beame, Borodin.. (1997) (Correct)
BibTeX entry: (Update)
@misc{ dai-lower,
author = "Flannery Dai",
title = "Lower Bounds for t-Reflecting Sequences: A Computational Approach",
url = "citeseer.ist.psu.edu/54810.html" }
Citations (may not include all citations):303 Princeton University Press (context) - Jr, Fulkerson et al. - 1962
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
41 Combinatorial Problems and Exercises (context) - Lovasz - 1979
27 Space lower bounds for maze threadability on restricted mach.. (context) - Cook, Rackoff - 1980
20 the cover time of random walks on graphs (context) - Kahn, Linial et al. - 1989
9 Lower bounds on universal traversal sequences for cycles and.. (context) - Tompa - 1990
7 Time-space tradeoffs for undirected graph connectivity (context) - Beame, Borodin et al.
5 A simple graph traversing problem (context) - Aleliunas - 1978
4 Personal Communication (context) - Buss - 1992
1 Bounds on universal traversal sequences (context) - Bar-Noy, Borodin et al. - 1989
1 Lower bounds on the length of universal sequences (context) - Borodin, Ruzzo et al.
Documents on the same site (http://www.wi.euv-frankfurt-o.de/icci94/absa.htm): More
Dynamic Subtrees: a New Data Structure for Manipulating Trees - Xu (1994) (Correct)
BIPARTITIONING into OVERLAPPING sets - Haralambides, Tragoudas (1994) (Correct)
An Optimal Resolution Sensitive Pyramid Representation for.. - Nardelli, Proietti (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