42 citations · 90 across the 7 of their papers we have counts for
5 papers · 1 filter
A Survey on the Densest Subgraph Problem and Its Variants
Tommaso Lanciano, Atsushi Miyauchi, Adriano Fazzone +1
The Densest Subgraph Problem requires to find, in a given graph, a subset of vertices whose induced subgraph maximizes a measure of density. The problem has received a great deal o…
Finding Densest -Connected Subgraphs
Francesco Bonchi, David García-Soriano, Atsushi Miyauchi +1
Dense subgraph discovery is an important graph-mining primitive with a variety of real-world applications. One of the most well-studied optimization problems for dense subgraph dis…
Hypergraph Clustering Based on PageRank
Yuuki Takai, Atsushi Miyauchi, Masahiro Ikeda +1
A hypergraph is a useful combinatorial object to model ternary or higher-order relations among entities. Clustering hypergraphs is a fundamental task in network analysis. In this s…
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…
The Densest Subgraph Problem with a Convex/Concave Size Function
Yasushi Kawase, Atsushi Miyauchi
In the densest subgraph problem, given an edge-weighted undirected graph , we are asked to find that maximizes the density, i.e., , where …