53 search results - page 2 / 11 » Spectral Densest Subgraph and Independence Number of a Graph |
JCT
2007
13 years 6 months ago
2007
Let G be a simple graph with n vertices and m edges. Let ω(G) and α(G) be the numbers of vertices of the largest clique and the largest independent set in G, respectively. In th...
IM
2007
13 years 6 months ago
2007
We examine the relationship of a graph G and its random subgraphs which are defined by independently choosing each edge with probability p. Suppose that G has a spectral gap λ (...
ISAAC
2007
Springer
14 years 11 days ago
2007
Springer
The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as K¨onig-Egerv´ary graphs. K¨onig-Egerv´ary graphs have been studied ex...
CIKM
2009
Springer
14 years 24 days ago
2009
Springer
In order to enable scalable querying of graph databases, intelligent selection of subgraphs to index is essential. An improved index can reduce response times for graph queries si...
SIAMDM
2008
13 years 6 months ago
2008
In this paper we consider the problem of testing whether a graph is triangle-free, and more generally, whether it is H-free, for a fixed subgraph H. The algorithm should accept gr...