1 citations · 1 across the 1 of their papers we have counts for
2 papers
cs.DS2016
Arbitrary Overlap Constraints in Graph Packing Problems
Alejandro López-Ortiz, Jazmín Romero
In earlier versions of the community discovering problem, the overlap between communities was restricted by a simple count upper-bound [17,5,11,8]. In this paper, we introduce the…
cs.DS2014★ 1 cited
Kernelization Algorithms for Packing Problems Allowing Overlaps (Extended Version)
Henning Fernau, Alejandro López-Ortiz, Jazmín Romero
We consider the problem of discovering overlapping communities in networks which we model as generalizations of Graph Packing problems with overlap. We seek a collection $\mathcal{…