Dense subgraph

In computer science the notion of highly connected subgraphs appears frequently. This notion can be formalized as follows. Let be an undirected graph… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Finding dense bipartite subgraphs and detecting the relations among them is an important problem for affiliation networks that… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2013
2013
In this work, we propose a new method to find homogeneous object groups in a single vertex-labeled graph. The basic premise is… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2012
Highly Cited
2012
This paper presents a method for identifying a set of dense subgraphs of a given sparse graph. Within the main applications of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Today's applications deal with multiple types of information: graph data to represent the relations between objects and attribute… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 7
Is this relevant?
Highly Cited
2010
Highly Cited
2010
This paper introduces a new definition of dense subgraph pattern, the DN -graph. DN -graph considers both the size of the… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2010
Highly Cited
2010
In the Densest k-Subgraph problem, given a graph G and a parameter k, one needs to find a subgraph of G induced on k vertices… (More)
Is this relevant?
Review
2010
Review
2010
In this chapter, we present a survey of algorithms for dense subgraph discovery. The problem of dense subgraph discovery is… (More)
  • table 10.1
  • table 10.2
  • figure 10.1
  • table 10.3
  • figure 10.2
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Given an undirected graph G = (V,E), the density of a subgraph on vertex set S is defined as d(S) = |E(S)| |S| , where E(S) is… (More)
Is this relevant?
Highly Cited
2005
Highly Cited
2005
We present a new algorithm for finding large, dense subgraphs in massive graphs. Our algorithm is based on a recursive… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
2005
2005
We note the condition 0 ≤ w(e) ≤ 1 is given since it is convenient for presenting our theoretical results, although we can define… (More)
Is this relevant?