Skip to search formSkip to main contentSkip to account menu

Euler tour technique

Known as: ET tree, Euler tour tree 
The Euler tour technique (ETT), named after Leonhard Euler, is a method in graph theory for representing trees. The tree is viewed as a directed… 
Wikipedia (opens in a new tab)

Related topics

Related topics

7 relations
Depth-first searchDirected graphGraph theoryLexicographical order

Broader (1)

Parallel computing

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2006
2006
Some Optimal Parallel Algorithms for Shortest Path Related Problems on Interval and Circular-arc Graphs
In this paper, we consider some shortest path related problems on interval and circular-arc graphs. For the all-pair shortest… 
1992
1992
Computation List Evaluation and Ist Applications
In this paper, we present an algorithm for a generalization of list ranking called computation list evaluation. As a consequence… 
1991
1991
Parallel Breadth-First and Breadth-Depth Traversals of Generated Trees
Two adaptive, level-order tree traversal algorithms are proposed for an exclusive-read and exclusive-write (EREW), parallel… 
1988
1988
Editor's foreword special issue on parallel and distributed computing, Part I
Recent years have seen phenomenol advances in the technologies of parallel computers and distributed computer systems. To the… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)