Sciweavers

JUCS
2007
99views more  JUCS 2007»
13 years 11 months ago
Spectral Densest Subgraph and Independence Number of a Graph
: 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...
Reid Andersen, Sebastian M. Cioaba
RECOMB
2010
Springer
14 years 6 months ago
Dense Subgraphs with Restrictions and Applications to Gene Annotation Graphs
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...
Barna Saha, Allison Hoch, Samir Khuller, Louiqa Ra...