13 citations · 48 across the 26 of their papers we have counts for
4 papers · 1 filter
-Distinct In- and Out-Branchings in Digraphs
Gregory Gutin, Felix Reidl, Magnus Wahlström
An out-branching and an in-branching of a digraph are called -distinct if each of them has arcs absent in the other. Bang-Jensen, Saurabh and Simonsen (2016) proved that…
Asymptotic Analysis of Equivalences and Core-Structures in Kronecker-Style Graph Models
Alex J. Chin, Timothy D. Goodrich, Michael P. O'Brien +3
Growing interest in modeling large, complex networks has spurred significant research into generative graph models. Kronecker-style models (SKG and R-MAT) are often used due to the…
Width, depth and space
Li-Hsuan Chen, Felix Reidl, Peter Rossmanith +1
The width measure treedepth, also known as vertex ranking, centered coloring and elimination tree height, is a well-established notion which has recently seen a resurgence of inter…
Characterising Bounded Expansion by Neighbourhood Complexity
Felix Reidl, Fernando Sánchez Villaamil, Konstantinos Stavropoulos
We show that a graph class has bounded expansion if and only if it has bounded -neighbourhood complexity, i.e. for any vertex set of any subgraph of $G\in\cal G…