DFS tree construction: Algorithms and characterizations: Preliminary version

Ephraim Korach, Zvi Ostfeld

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

7 Scopus citations

Abstract

The Depth First Search (DFS) algorithm is one of the basic techniques which is used in a very large variety of graph algorithms. Every application of the DFS involves, beside traversing the graph, constructing a special structured tree, called a DFS tree. In this paper, we give a complete characterization of all the graphs in which every spanning tree is a DFS tree. These graphs are called Total-DFS-Graphs. The characterization we present shows that a large variety of graphs are not Total-DFS-Graphs, and therefore the following question is naturally raised: Given an undirected graph G=(V,E) and an undirected spanning tree T, is T a DFS tree of G? We give an algorithm to answer this question in linear (O(|E|)) time.

Original languageEnglish
Title of host publicationGraph-Theoretic Concepts in Computer Science - International Workshop, WG 1988, Proceedings
EditorsJ. van Leeuwen
PublisherSpringer Verlag
Pages87-106
Number of pages20
ISBN (Print)9783540507284
DOIs
StatePublished - 1 Jan 1989
Externally publishedYes
Event14th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 1988 - Amsterdam, Netherlands
Duration: 15 Jun 198817 Jun 1988

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume344 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference14th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 1988
Country/TerritoryNetherlands
CityAmsterdam
Period15/06/8817/06/88

Fingerprint

Dive into the research topics of 'DFS tree construction: Algorithms and characterizations: Preliminary version'. Together they form a unique fingerprint.

Cite this