13 citations · 48 across the 26 of their papers we have counts for
6 papers · 1 filter
Overlapping Communities in Social Networks
Jan Dreier, Philipp Kuinke, Rafael Przybylski +3
Complex networks can be typically broken down into groups or modules. Discovering this "community structure" is an important step in studying the large-scale structure of networks.…
Kernelization and Sparseness: the case of Dominating Set
Pål Grønås Drange, Markus S. Dregi, Fedor V. Fomin +9
We prove that for every positive integer and for every graph class of bounded expansion, the -Dominating Set problem admits a linear kernel on graphs from $\mat…
Zig-Zag Numberlink is NP-Complete
Aaron Adcock, Erik D. Demaine, Martin L. Demaine +4
When can terminal pairs in an grid be connected by vertex-disjoint paths that cover all vertices of the grid? We prove that this problem is NP-complete. Our ha…
Hyperbolicity, degeneracy, and expansion of random intersection graphs
Matthew Farrell, Timothy Goodrich, Nathan Lemons +3
We establish the conditions under which several algorithmically exploitable structural features hold for random intersection graphs, a natural model for many real-world networks wh…
Structural Sparsity of Complex Networks: Bounded Expansion in Random Models and Real-World Graphs
Erik D. Demaine, Felix Reidl, Peter Rossmanith +3
This research establishes that many real-world networks exhibit bounded expansion, a strong notion of structural sparsity, and demonstrates that it can be leveraged to design effic…
A Faster Parameterized Algorithm for Treedepth
Felix Reidl, Peter Rossmanith, Fernando Sanchez Villaamil +1
The width measure \emph{treedepth}, also known as vertex ranking, centered coloring and elimination tree height, is a well-established notion which has recently seen a resurgence o…