Iskanje po repozitoriju

Opis: 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.
Ključne besede: graph search, graph search trees, leaves, chordal graphs
Objavljeno v RUP: 21.12.2025; Ogledov: 184; Prenosov: 1
Celotno besedilo (515,71 KB)

Ključne besede: vehicle routing, multi-echelon, variable neighborhood search, wood waste
Objavljeno v RUP: 15.09.2024; Ogledov: 1316; Prenosov: 23
Celotno besedilo (2,66 MB)

Ključne besede: graph search methods, breadth first search, depth first search
Objavljeno v RUP: 18.10.2021; Ogledov: 2736; Prenosov: 24
Povezava na celotno besedilo

Ključne besede: graph search, search tree, polynomial-time algorithms, BFS, DFS
Objavljeno v RUP: 02.10.2020; Ogledov: 3664; Prenosov: 27
Povezava na celotno besedilo

Ključne besede: Data mining, machine learning, classification rules, association rules, search, heuristics
Objavljeno v RUP: 14.11.2019; Ogledov: 4677; Prenosov: 405
Celotno besedilo (11,75 MB)
Gradivo ima več datotek! Več...