53 search results - page 1 / 11 » Spectral Densest Subgraph and Independence Number of a Graph |
JUCS
2007
13 years 5 months ago
2007
: In this paper, we study spectral versions of the densest subgraph problem and the largest independence subset problem. In the first part, we give an algorithm for identifying sm...
RECOMB
2010
Springer
14 years 9 days ago
2010
Springer
Abstract. In this paper, we focus on finding complex annotation patterns representing novel and interesting hypotheses from gene annotation data. We define a generalization of th...
SODA
2012
ACM
11 years 7 months ago
2012
ACM
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
CORR
2011
Springer
13 years 13 days ago
2011
Springer
We consider the problem of identifying a team of skilled individuals for collaboration, in the presence of a social network. Each node in the input social network may be an expert...
JGT
2007
13 years 5 months ago
2007
: Let G be a graph on n vertices in which every induced subgraph on s = log3 n vertices has an independent set of size at least t = log n. What is the largest q = q(n) so that ever...