ScholarLens Back to search
1987•DAIMI Report SeriesOpen access

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

Sven Skyum

Open full text 0 citations

Abstract

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.

About this research paper

What this paper is about

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.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

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.

Key concepts: Tree traversal, Graph traversal, Depth-first search, Spanning tree, Breadth-first search, Computer science, Modular design, Tree (set theory)

Related papers

Related paper 1Related paper 2
Back to paper searchBrowse research topicsOriginal source
A Distributed Election and Spanning Tree Algorithm Based on Depth First Search — Research Paper | ScholarLens