328 search results - page 20 / 66 » Homomorphism bounded classes of graphs |
APPROX
2007
Springer
14 years 14 days ago
2007
Springer
We show that the multi-commodity max-flow/min-cut gap for series-parallel graphs can be as bad as 2, matching a recent upper bound [8] for this class, and resolving one side of a ...
CDC
2010
IEEE
13 years 3 months ago
2010
IEEE
We derive lower bounds on the convergence speed of a widely used class of distributed averaging algorithms. In particular, we prove that any distributed averaging algorithm whose ...
PODS
2008
ACM
14 years 8 months ago
2008
ACM
Conjunctive query (CQ) evaluation on relational databases is NP-complete in general. Several restrictions, like bounded tree-width and bounded hypertree-width, allow polynomial ti...
COMGEO
2011
ACM
13 years 3 months ago
2011
ACM
Let P be a set of n points in the plane. A geometric proximity graph on P is a graph where two points are connected by a straight-line segment if they satisfy some prescribed prox...
CAS
2008
13 years 8 months ago
2008
In this paper we first present a novel approach to determine the structural information content (graph entropy) of a network represented by an undirected and connected graph. Such...