scholarly journals Batch-Parallel Euler Tour Trees

2019 ◽  
pp. 92-106 ◽  
Author(s):  
Thomas Tseng ◽  
Laxman Dhulipala ◽  
Guy Blelloch
Keyword(s):  
Euler Tour

ON FINDING EULER TOURS IN PARALLEL

1993 ◽  
Vol 03 (03) ◽  
pp. 223-231 ◽  
Author(s):  
EDSON N. CACERES ◽  
NARSINGH DEO ◽  
SHIVAKUMAR SASTRY ◽  
JAYME L. SZWARCFITER
Keyword(s):  
Parallel Algorithm ◽  
Spanning Tree ◽  
Intermediate Step ◽  
Euler Tour ◽  
Euler Tours

We describe an alternative implementation of Atallah and Vishkin’s parallel algorithm for finding an Euler Tour of a graph. Instead of finding a spanning tree as an intermediate step, this algorithm is based on identifying a strut which is easier to compute. Using the strut, vertices which have more than one circuit passing through them are identified directly. Stitching at such vertices reduces the number of circuits in the Euler Partition.

COMPUTATION LIST EVALUATION AND ITS APPLICATIONS

1992 ◽  
Vol 02 (04) ◽  
pp. 321-329 ◽  
Author(s):  
ELIEZER A. ALBACEA
Keyword(s):  
Simple Algorithm ◽  
List Ranking ◽  
Tree Contraction ◽  
Euler Tour ◽  
Problem Instances

In this paper, we present an algorithm for a generalization of list ranking called computation list evaluation. As a consequence of the generalization and the existence of this algorithm for computation list evaluation, we obtain a generalization of Euler Tour technique. Finally, we present several applications of the generalized Euler Tour technique. Of interest in the applications is the identification of a set of problem instances that are solvable using tree contraction and which can alternatively be solved using a simple algorithm based on the generalized Euler Tour technique.

scholarly journals Euler Tour Lock-In Problem in the Rotor-Router Model

2009 ◽  
pp. 423-435 ◽  
Author(s):  
Evangelos Bampas ◽  
Leszek Gąsieniec ◽  
Nicolas Hanusse ◽  
David Ilcinkas ◽  
Ralf Klasing ◽  
...  
Keyword(s):  
Euler Tour ◽  
Lock In

scholarly journals Hamilton cycles in Euler tour graph

1986 ◽  
Vol 40 (1) ◽  
pp. 1-8 ◽  
Author(s):  
Fu-Ji Zhang ◽  
Xiao-fong Guo
Keyword(s):  
Hamilton Cycles ◽  
Euler Tour

AN OPTIMAL RANDOMIZED PARALLEL ALGORITHM FOR THE SINGLE FUNCTION COARSEST PARTITION PROBLEM

1996 ◽  
Vol 06 (02) ◽  
pp. 187-193
Author(s):  
JOSEPH JÁJÁ ◽  
KWAN WOO RYU
Keyword(s):  
Parallel Algorithm ◽  
High Probability ◽  
Rooted Tree ◽  
Partition Problem ◽  
Single Function ◽  
Crew Pram ◽  
Euler Tour ◽  
Crcw Pram

We describe a randomized parallel algorithm to solve the single function coarsest partition problem. The algorithm runs in O( log n) time using O(n) operations with high probability on the Priority CRCW PRAM. The previous best known algorithms run in O( log 2 n) time using O(n log 2 n) operations on the CREW PRAM and O( log n) time using O(n log log n) operations on the Arbitrary CRCW PRAM. The technique presented can be used to generate the Euler tour of a rooted tree optimally from the parent representation.

My Euler Tour

Math Horizons ◽  
2007 ◽  
Vol 15 (2) ◽  
pp. 36-37
Author(s):  
Jonathan Benefiel
Keyword(s):  
Euler Tour
Sign in / Sign up

Export Citation Format

Share Document