42 citations · 90 across the 7 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.SI2018
Robust Densest Subgraph Discovery
Atsushi Miyauchi, Akiko Takeda
Dense subgraph discovery is an important primitive in graph mining, which has a wide variety of applications in diverse domains. In the densest subgraph problem, given an undirecte…
cs.DS2018
Finding Cheeger Cuts in Hypergraphs via Heat Equation
Masahiro Ikeda, Atsushi Miyauchi, Yuuki Takai +1
Cheeger's inequality states that a tightly connected subset can be extracted from a graph using an eigenvector of the normalized Laplacian associated with . More specificall…