Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

JUCS
2007

favoriteEmaildiscussreport

99views more JUCS 2007»

Spectral Densest Subgraph and Independence Number of a Graph

13 years 4 months ago

Spectral Densest Subgraph and Independence Number of a Graph

Download www.jucs.org

: In this paper, we study spectral versions of the densest subgraph problem and the largest independence subset problem. In the ﬁrst part, we give an algorithm for identifying small subgraphs with large spectral radius. We also prove a Hoﬀman-type ratio bound for the order of an induced subgraph whose spectral radius is bounded from above. Key Words: graphs, eigenvalues, densest subgraph, independence number Category: F.4.1

Reid Andersen, Sebastian M. Cioaba

Real-time Traffic

Densest Subgraph | Densest Subgraph Problem | JUCS 2007 | Spectral Radius |

claim paper

Related Content

» Dense Subgraphs with Restrictions and Applications to Gene Annotation Graphs

» Polynomial integrality gaps for strong SDP relaxations of Densest ksubgraph

» Multiskill Collaborative Teams based on Densest Subgraphs

» On graphs with subgraphs having large independence numbers

» Laplacian spectral bounds for clique and independence numbers of graphs

» The Spectral Gap of a Random Subgraph of a Graph

» The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number

» Independent informative subgraph mining for graph information retrieval

» Testing TriangleFreeness in General Graphs

Post Info
More Details (n/a)

Added	16 Dec 2010
Updated	16 Dec 2010
Type	Journal
Year	2007
Where	JUCS
Authors	Reid Andersen, Sebastian M. Cioaba

Comments (0)