S. Hoory and A. Wigderson. Universal sequences for expander graphs. Hebrew University, Jerusalem, December 1989. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Time-Space Tradeoffs for Graph s-t Connectivity - Barnes (1992) (Correct)
....directed graphs are of exponential length, Aleliunas et al. AKL 79] prove (nonconstructively) that universal traversal sequences of polynomial length exist for undirected graphs. Upper and lower bounds on the length of UTS s are known for various types of graphs [AAR90, BNBK 89, BRT89, HW89, Tom90] Some authors show how to construct superpolynomial length sequences [BNS89, BNBK 89, Bri87, KPS88, Nis90] and Istrail shows how to construct polynomial length sequences for certain classes of graphs [Ist88, Ist90] If one could construct polynomial length UTS s for arbitrary graphs ....
S. Hoory and A. Wigderson. Universal sequences for expander graphs. Hebrew University, Jerusalem, December 1989.
Deterministic Algorithms for Undirected s-t Connectivity Using .. - Barnes, Ruzzo (1991) (1 citation) (Correct)
....is solvable by a deterministic logarithmic space algorithm, and perhaps showing this would be an easier first step towards the main goal. In fact, considerable effort has been expended on this step, for example in studying and attempting to constructively generate universal traversal sequences [1, 2, 3, 4, 8, 9, 12, 13, 14, 15, 19, 25]. Alternatively, if deterministic and nondeterministic classes are distinct, then ustcon is a likely candidate for a problem that will separate the classes. In either case, its complexity is of interest. Settling the deterministic space complexity of ustcon is a very difficult open problem. A ....
S. Hoory and A. Wigderson. Universal sequences for expander graphs. Hebrew University, Jerusalem, Dec. 1989.
Time-Space Tradeoffs for Undirected Graph Traversal - Beame, Borodin, Raghavan.. (1993) (5 citations) (Correct)
....A special case of bijective labelings are the symmetric labelings, where all edges have the same label in each direction, i.e. u;v = v;u for all u; v. Universal traversal sequences for regular graphs with bijective and symmetric labelings have been considered previously by Hoory and Wigderson [23] and Istrail [26] respectively, although under different names. Both papers used the term consistent for these two different classes of restricted labelings. Not all graphs have symmetric labelings, and while every graph does have a bijective labeling, such labelings are not known to be ....
....of Lemma 5. Let U be a half edge universal traversal sequence, and for a vertex w, define #w to be the length of the shortest prefix of U that walks from w to the fixed pebble. Since the graph is bijectively labeled, these vertex numbers will be unique. This idea is used by Hoory and Wigderson [23]. For 1 i jU j 1, let v i be the vertex reached from the fixed pebble by walking according to the length i 0 1 prefix of U . Suppose again that the values i and #v i are stored in the state, the movable pebble is on v i , and a i is the i th symbol of U . Then, for the neighbor v i 1 of v i ....
S. Hoory and A. Wigderson. Universal sequences for expander graphs. Hebrew University, Jerusalem, Dec. 1989.
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