NDLI: The Euler tour technique and parallel rooted spanning tree

Content Provider	IEEE Xplore Digital Library
Author	Guojin Cong Bader, D.A.
Copyright Year	2004
Description	Author affiliation: Dept. of Electr. & Comput. Eng., New Mexico Univ., Albuquerque, NM, USA (Guojin Cong; Bader, D.A.)
Abstract	Many parallel algorithms for graph problems start with finding a spanning tree and rooting the tree to define some structural relationship on the vertices which can be used by following problem specific computations. The generic procedure is to find an unrooted spanning tree and then root the spanning tree using the Euler tour technique. With a randomized work-time optimal unrooted spanning tree algorithm and work-time optimal list ranking, finding rooted spanning trees can be done work-time optimally on EREW PRAM w.h.p. Yet the Euler tour technique assumes as "given" a circular adjacency list, it is not without implications though to construct the circular adjacency list for the spanning tree found on the fly by a spanning tree algorithm. In fact our experiments show that this "hidden" step of constructing a circular adjacency list could take as much time as both spanning tree and list ranking combined. We present new efficient algorithms that find rooted spanning trees without using the Euler tour technique and incur little or no overhead over the underlying spanning tree algorithms. We also present two new approaches that construct Euler tours efficiently when the circular adjacency list is not given. One is a deterministic PRAM algorithm and the other is a randomized algorithm in the symmetric multiprocessor (SMP) model. The randomized algorithm takes a novel approach for the problems of constructing the Euler tour and rooting a tree. It computes a rooted spanning tree first, then constructs an Euler tour directly for the tree using depth-first traversal. The tour constructed is cache-friendly with adjacent edges in the tour stored in consecutive locations of an array so that prefix-sum (scan) can be used for tree computations instead of the more expensive list-ranking.
Starting Page	448
Ending Page	457
File Size	587220
Page Count	10
File Format	PDF
ISBN	0769521975
ISSN	01903918
DOI	10.1109/ICPP.2004.1327954
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2004-08-15
Publisher Place	Canada
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Tree graphs Parallel algorithms Phase change random access memory Contracts Concurrent computing Engineering profession US Department of Energy Laboratories Ear Testing
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

A fast, parallel spanning tree algorithm for symmetric multiprocessors

Finding biconnected componemts and computing tree functions in logarithmic parallel time

Optimal EREW parallel algorithms for connectivity, ear decomposition and st-numbering of planar graphs

Parallel external memory graph algorithms

A deterministic parallel algorithm for planar graphs isomorphism

Parallel algorithms for planar graph isomorphism and related problems

A new framework for designing parallel algorithms on series parallel graphs

An optimal parallel algorithm for graph planarity

Minimum spanning tree on the HMESH architecture

The Euler tour technique and parallel rooted spanning tree

Similar Documents

A fast, parallel spanning tree algorithm for symmetric multiprocessors

Finding biconnected componemts and computing tree functions in logarithmic parallel time

Optimal EREW parallel algorithms for connectivity, ear decomposition and st-numbering of planar graphs

Parallel external memory graph algorithms

A deterministic parallel algorithm for planar graphs isomorphism

Parallel algorithms for planar graph isomorphism and related problems

A new framework for designing parallel algorithms on series parallel graphs

An optimal parallel algorithm for graph planarity

Minimum spanning tree on the HMESH architecture

The Euler tour technique and parallel rooted spanning tree