Ephraim Korach, Zvi Ostfeld  Home/Search
Context
Related
| math.tau.ac.il/~ostfeld/pape...JGT.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: math.tau.ac.il/...raph_algorithms (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The Depth First Search (DFS) algorithm is one of the basic techniques which is used in a very large variety of graph algorithms. Most applications of the DFS involve the construction of a depth-first spanning tree (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. We prove that Total -DFS-Graphs are closed under minors. It follows by the work of Robertson and Seymour on graph... (Update)
Active bibliography (related documents): More All
0.6: Optimal Distributed Algorithms for Constructing a.. - Makki, Havas (Correct)
0.5: Open Problems 12 - It Was (Correct)
0.3: Narrowness, Path-width, and their Application in Natural.. - Kornai, Tuza (1992) (Correct)
Similar documents based on text: More All
0.4: Depth First Search in Graphs - Abraham (2003) (Correct)
0.4: Optimal Synchronizing of ABD Networks - Tel, Korach, Zaks (1988) (Correct)
0.3: Graph Minors and Graphs on Surfaces - Mohar (2001) (Correct)
BibTeX entry: (Update)
@article{ korach95existence,
author = "Korach and Ostfeld",
title = "On the Existence of Special Depth First Search Trees",
journal = "JGT: Journal of Graph Theory",
volume = "19",
year = "1995",
url = "citeseer.ist.psu.edu/16448.html" }
Citations (may not include all citations):4212 Computers and Intractability: A Guide to the Theory of NPCom.. (context) - Garey, Johnson - 1979
405 Depth-first search and linear graph algorithms (context) - Tarjan - 1972
227 Parallel merge sort (context) - Cole - 1986
117 Efficient planarity testing (context) - Hopcroft, Tarjan - 1974
80 The Disjoint Paths Problem (context) - Robertson, Seymour et al. - 1986
77 Dividing a graph into triconnected components (context) - Hopcroft, Tarjan - 1973
77 An efficient parallel biconnectivity algorithm (context) - Tarjan, Vishkin - 1985
55 American Elsevier Publishing Co (context) - Bondy, Murty et al. - 1977
29 Depth-first search is inherently sequential (context) - Reif - 1985
23 A random NC algorithm for depth-first search (context) - Aggarwal, Anderson - 1988
15 Lectures on matroids (context) - Tutte - 1965
14 A new distributed depth-first-search algorithm (context) - Awerbuch - 1985
11 Nonconstructive Tools for Proving Polynomial-Time Decidabili.. (context) - Fellows, Langston - 1988
11 Graph Width and Well-Quasi-Ordering: a Survey (context) - Robertson, Seymour - 1984
10 Efficient algorithms for graph manipulation (context) - Hopcroft, Tarjan - 1973
7 A nearly optimal parallel algorithm for constructing depth f.. (context) - He, Yesha - 1988
5 Parallel algorithms for depth-first searches (context) - Smith - 1986
3 Randomly traceable graphs (context) - Chartrand, Kronk - 1968
3 Combinatorial Theory Ser (context) - Robertson, Seymour et al. - 1986
3 Handbook of Theoretical Computer Science (context) - Courcelle - 1990
2 An efficient parallel algorithm for shifting the root of a d.. (context) - Tiwari - 1986
2 A time-optimal message-efficient distributed algorithm for D.. (context) - Lakshmanan, Meenakshi et al. - 1987
1 The monadic second-order logic of graphs : definable sets of.. (context) - Courcelle - 1988
1 Recognition of Spanning Trees Defined by Graph Searches (context) - Hagerup, Nowak - 1985
1 Langston On Finding Optimal and Near-Optimal Lineal Spanning.. (context) - Fellows, Friesen - 1988
1 Series-parallel graphs and depth-first search trees (context) - Syslo - 1984
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC