Trees and Graph Traversals

A tree is a connected acyclic graph and a forest consists of trees. In this chapter, we first describe the tree structure, algorithms to construct a spanning tree of a graph, and tree traversal algorithms. Two main methods of graph traversal are depth-first search and breadth-first search. We review...

Full description

Saved in:
Bibliographic Details
Published inGuide to Graph Algorithms pp. 139 - 175
Main Author Erciyes, K
Format Book Chapter
LanguageEnglish
Published Switzerland Springer International Publishing AG 2018
Springer International Publishing
SeriesTexts in Computer Science
Subjects
Back Edge
Graph Traversal
NACK Message
Spanning Tree
Tree Edges
Online AccessGet full text
ISBN331973234X
9783319732343
ISSN1868-0941
1868-095X
DOI10.1007/978-3-319-73235-0_6

Cover

More Information
Summary:A tree is a connected acyclic graph and a forest consists of trees. In this chapter, we first describe the tree structure, algorithms to construct a spanning tree of a graph, and tree traversal algorithms. Two main methods of graph traversal are depth-first search and breadth-first search. We review sequential, parallel, and distributed algorithms for these traversals along with their various applications.
ISBN:331973234X
9783319732343
ISSN:1868-0941
1868-095X
DOI:10.1007/978-3-319-73235-0_6