8 citations · 19 across the 10 of their papers we have counts for
Showing 2026Show all
3 papers · 1 filter
cs.DS2026
On Kernels and Leaves: Searching for Bare and Lush Trees
Jesse Beisegel, Ekkehard Köhler, Robert Scheffler +1
We study a variation of the classical Maximum (Minimum) Leaf Spanning Tree problem. In many applications, Depth-First Search (DFS) is used to compute a spanning tree of a graph. Su…
cs.DM2026
Generalized Graph Search Trees
Florian Krowiorz, Robert Scheffler
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 tre…
cs.DM2026
Simultaneous Graph Parameters and How to Bound Them
Robert Scheffler, Philipp Wolf Schleicher
Beisegel et al. [SWAT 2024] introduced the concept of simultaneous -numbers which associate a graph class with a graph parameter. Given a graph , the…