# Dense subgraph

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2018

2018

- WSDM
- 2018

Finding dense bipartite subgraphs and detecting the relations among them is an important problem for affiliation networks thatâ€¦Â (More)

Is this relevant?

2013

2013

- Knowledge and Information Systems
- 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)

Is this relevant?

Highly Cited

2012

Highly Cited

2012

- IEEE Transactions on Knowledge and Dataâ€¦
- 2012

This paper presents a method for identifying a set of dense subgraphs of a given sparse graph. Within the main applications ofâ€¦Â (More)

Is this relevant?

Highly Cited

2010

Highly Cited

2010

- IEEE International Conference on Data Mining
- 2010

Today's applications deal with multiple types of information: graph data to represent the relations between objects and attributeâ€¦Â (More)

Is this relevant?

Highly Cited

2010

Highly Cited

2010

- PVLDB
- 2010

This paper introduces a new definition of dense subgraph pattern, the DN -graph. DN -graph considers both the size of theâ€¦Â (More)

Is this relevant?

Highly Cited

2010

Highly Cited

2010

- STOC
- 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

- Managing and Mining Graph Data
- 2010

In this chapter, we present a survey of algorithms for dense subgraph discovery. The problem of dense subgraph discovery isâ€¦Â (More)

Is this relevant?

Highly Cited

2009

Highly Cited

2009

- ICALP
- 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

- VLDB
- 2005

We present a new algorithm for finding large, dense subgraphs in massive graphs. Our algorithm is based on a recursiveâ€¦Â (More)

Is this relevant?

2005

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?