A Distributed Election and Spanning Tree Algorithm Based on Depth First Search

DAIMI Report Series

View Publication Info
 
 
Field Value
 
Title A Distributed Election and Spanning Tree Algorithm Based on Depth First Search
 
Creator Skyum, Sven
 
Description The existence of an effective traversal algorithm for a class of graphs has proven useful in connection with election problems for those classes. In this paper we show how a general traversal algorithm, such as depth first search, can be turned into an effective election algorithm using modular techniques. The presented method also constructs a spanning tree for the graph.
 
Publisher Aarhus University
 
Contributor
 
Date 1987-08-01
 
Type info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
 
Format application/pdf
 
Identifier http://ojs.statsbiblioteket.dk/index.php/daimipb/article/view/7588
10.7146/dpb.v16i232.7588
 
Source DAIMI Report Series; No 232 (1987): PB-232 A Distributed Election and Spanning Tree Algorithm Based on Depth First Search Traversals
DAIMI Report Series; No 232 (1987): PB-232 A Distributed Election and Spanning Tree Algorithm Based on Depth First Search Traversals
2245-9316
0105-8517
 
Language eng
 
Relation http://ojs.statsbiblioteket.dk/index.php/daimipb/article/view/7588/6433
 

Contact Us

The PKP Index is an initiative of the Public Knowledge Project.

For PKP Publishing Services please use the PKP|PS contact form.

For support with PKP software we encourage users to consult our wiki for documentation and search our support forums.

For any other correspondence feel free to contact us using the PKP contact form.

Find Us

Twitter

Copyright © 2015-2018 Simon Fraser University Library