15 citations · 44 across the 9 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.DM2017
Computing the maximum matching width is NP-hard
Kwangjun Ahn, Jisu Jeong
The maximum matching width is a graph width parameter that is defined on a branch-decomposition over the vertex set of a graph. In this short paper, we prove that the problem of co…
cs.IT2017
Community Recovery in Hypergraphs
Kwangjun Ahn, Kangwook Lee, Changho Suh
Community recovery is a central problem that arises in a wide variety of applications such as network clustering, motion segmentation, face clustering and protein complex detection…