Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
We investigate the computational complexity of the Densestk-Subgraph problem, where the input is an undirected graph G=(V,E) and… Expand
  • table 1
  • table 2
  • figure 1
Is this relevant?
Highly Cited
2013
Highly Cited
2013
In this paper, we introduce a subcategory-aware object classification framework to boost category level object classification… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2013
Highly Cited
2013
Recent years have witnessed an unprecedented proliferation of social media. People around the globe author, everyday, millions of… Expand
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2012
Highly Cited
2012
  • J. Chen, Y. Saad
  • IEEE Transactions on Knowledge and Data…
  • 2012
  • Corpus ID: 11360561
This paper presents a method for identifying a set of dense subgraphs of a given sparse graph. Within the main applications of… Expand
  • 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… Expand
  • 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… Expand
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
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)=\frac{|E(S)|}{|S|}$, where E… Expand
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… Expand
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2002
Highly Cited
2002
The k-f(k) dense subgraph problem ((k, f(k))-DSP) asks whether there is a k-vertex subgraph of a given graph G which has at least… Expand
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Given an n-vertex graph with nonnegative edge weights and a positive integer k?n, our goal is to find a k-vertex subgraph with… Expand
Is this relevant?