2 citations · 2 across the 4 of their papers we have counts for
5 papers
Breadth-First Search Trees with Many or Few Leaves
Jesse Beisegel, Ekkehard Köhler, Robert Scheffler +1
The Maximum (Minimum) Leaf Spanning Tree problem asks for a spanning tree with the largest (smallest) number of leaves. As spanning trees are often computed using graph search algo…
Lower bounds on collective additive spanners
Derek G. Corneil, Feodor F. Dragan, Ekkehard Köhler +1
In this paper we present various lower bound results on collective tree spanners and on spanners of bounded treewidth. A graph is said to admit a system of collective addit…
Graph parameters that are coarsely equivalent to path-length
Feodor F. Dragan, Ekkehard Köhler
Two graph parameters are said to be coarsely equivalent if they are within constant factors from each other for every graph . Recently, several graph parameters were shown to be…
Linear Time LexDFS on Chordal Graphs
Jesse Beisegel, Ekkehard Köhler, Robert Scheffler +1
Lexicographic Depth First Search (LexDFS) is a special variant of a Depth First Search (DFS), which was introduced by Corneil and Krueger in 2008. While this search has been used i…
Recognizing Graph Search Trees
Jesse Beisegel, Carolin Denkert, Ekkehard Köhler +4
Graph searches and the corresponding search trees can exhibit important structural properties and are used in various graph algorithms. The problem of deciding whether a given span…