53 search results - page 7 / 11 » Spectral Densest Subgraph and Independence Number of a Graph |
91
Voted
ALGORITHMICA
2006
14 years 11 months ago
2006
The k-Leaf Power recognition problem is a particular case of graph power problems: For a given graph it asks whether there exists an unrooted tree--the k-leaf root--with leaves on...
100
Voted
SODA
1992
ACM
15 years 24 days ago
1992
ACM
Let P be a property of undirected graphs. We consider the following problem: given a graph G that has property P, nd a minimal spanning subgraph of G with property P. We describe ...
77
Voted
ARITH
2005
IEEE
15 years 5 months ago
2005
IEEE
We present a radix-2 online computational scheme for evaluating multinomials in a fixed-point number representation system. Its main advantage is that it can adapt to any evaluat...
108
click to vote
PPOPP
2006
ACM
15 years 5 months ago
2006
ACM
Performance analysis tools are critical for the effective use of large parallel computing resources, but existing tools have failed to address three problems that limit their scal...
98
Voted
RSA
2011
14 years 6 months ago
2011
In 2007 we introduced a general model of sparse random graphs with independence between the edges. The aim of this paper is to present an extension of this model in which the edge...