Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2609.08625

Generalized Graph Search Trees

Florian Krowiorz·Robert Scheffler
View original source ↗Read source document ↗Export metadata ↓

Abstract

Graph search algorithms and their corresponding graph search trees are commonly used in algorithmic graph theory. In recent years, the recognition problem of these graph search trees has received significant attention. So far, the research has focused on two types of search trees: first-in trees that behave like BFS-trees and last-in trees that behave like DFS-trees. The search tree paradigms differ from each other by the parent a vertex is connected to. In first-in trees, it is the first visited neighbor, while in last-in trees it is the last neighbor visited before that vertex. Here, we will generalize these concepts of graph search trees by allowing every preceding neighbor of a vertex to be the parent. We study the complexity of the recognition problem of these generalized graph search trees. We present NP-completeness proofs for most searches. We also show that the problem is trivial for Generic Search and polynomial-time solvable for several searches on bipartite graphs and chordal graphs. We also study the question how fixing the start vertex influences the complexity of the problem.

Explore related subjects

cs.DMcs.DS

Keep this discovery

BibTeXRIS

Florian Krowiorz, Robert Scheffler. 2026-09-08. Generalized Graph Search Trees. https://arxiv.org/abs/2609.08625

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

cs.DM subjectcs.DS subject

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

arXiv2026

Oracle-free Boltzmann Sampling for Powersets

We propose an approach for sampling powersets under the Boltzmann distribution in an oracle-free way, i.e. without numerically evaluating the associated generating function. Our approach relies on a Poissonised infinite occupancy model and thinning. It yields an explicit sampler for bounded counting sequences and extends under mild growth conditions. We implement the sampler and find runtimes comparable to existing Boltzmann samplers.

cs.DM↗
arXiv2026

The Minimum-Weight Mixed Dominating Set on Threshold Graphs

We study the minimum-weight mixed dominating set problem on threshold graphs. In this problem, vertices and edges have weights, and the goal is to find a mixed set of minimum total weight that dominates every vertex and edge of the graph. We first show that arbitrary weights can be reduced to non-negative weights without changing the asymptotic running time. By adapting a reduction to the minimum-weight edge cover given in Ferrarini, Kober, Lancini, and Yuditsky, we obtain an $\mathcal{O}(n^5)$-time algorithm for the minimum weight mixed dominating set problem on threshold graphs.

cs.DS↗
arXiv2026

An Exposition of the $\widetilde{O}(\log^{1/4} n)$ Bound for the Komlós Problem

A conjecture of Komlós states that the combinatorial discrepancy of any matrix $A\in\mathbb R^{m\times n}$ whose columns have Euclidean norm at most one is bounded by a universal constant. We prove that the combinatorial discrepancy of every such matrix is at most $O((\log n)^{1/4}(\log\log n)^{7/4})$. This is the first asymptotic improvement over the $O(\sqrt{\log n})$ bound established by Banaszczyk [Banaszczyk, Random Struct.\ Algorithms, 1998], and it refutes a conjecture of Hajela [Hajela, European J.\ Combin., 1988] that a lower bound of order $Ω(\sqrt{\log n})$ should hold.

math.CO↗