1729 search results - page 49 / 346 » On Bounds for the k-Partitioning of Graphs |
CORR
2010
Springer
15 years 2 months ago
2010
Springer
A class of graphs is nowhere dense if for every integer r there is a finite upper bound on the size of cliques that occur as (topological) r-minors. We observe that this tameness ...
122
click to vote
ECCC
2008
15 years 2 months ago
2008
Testing a property P of graphs in the bounded degree model is the following computational problem: given a graph G of bounded degree d we should distinguish (with probability 0.9,...
115
click to vote
RSA
2002
15 years 1 months ago
2002
: The decycling number (G) of a graph G is the smallest number of vertices which can be removed from G so that the resultant graph contains no cycles. In this paper, we study the d...
121
click to vote
IPPS
2010
IEEE
14 years 12 months ago
2010
IEEE
Abstract--NABBIT is a work-stealing library for execution of task graphs with arbitrary dependencies which is implemented as a library for the multithreaded programming language Ci...
CORR
2007
Springer
15 years 1 months ago
2007
Springer
We give a fully polynomial randomized approximation scheme to compute a lower bound for the matching polynomial of any weighted graph at a positive argument. For the matching poly...