Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

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

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

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

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

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

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

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

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?