Search the repository

Abstract: Graph searches and their respective search trees are widely used in algorithmic graph theory. The problem whether a given spanning tree can be a graph search tree has been considered for different searches, graph classes and search tree paradigms. Similarly, the question whether a particular vertex can be visited last by some search has been studied extensively in recent years. We combine these two problems by considering the question whether a vertex can be a leaf of a graph search tree. We show that for particular search trees, including DFS trees, this problem is easy if we allow the leaf to be the first vertex of the search ordering. We contrast this result by showing that the problem becomes hard for many searches, including DFS and BFS, if we forbid the leaf to be the first vertex. Additionally, we present several structural and algorithmic results for search tree leaves of chordal graphs.
Keywords: graph search, graph search trees, leaves, chordal graphs
Published in RUP: 21.12.2025; Views: 236; Downloads: 2
Full text (515,71 KB)

Keywords: graph search methods, breadth first search, depth first search
Published in RUP: 18.10.2021; Views: 2810; Downloads: 25
Link to full text

Keywords: graph search, search tree, polynomial-time algorithms, BFS, DFS
Published in RUP: 02.10.2020; Views: 3760; Downloads: 28
Link to full text

Keywords: end-vertex, graph search, maximum cardinality search, maximal neighborhood search, graph classes
Published in RUP: 22.08.2019; Views: 3058; Downloads: 52
Link to full text