120 search results - page 13 / 24 » siamcomp 2008 |
SIAMCOMP
2002
14 years 9 months ago
2002
A set of vertices in a graph is a dominating set if every vertex outside the set has a neighbor in the set. The domatic number problem is that of partitioning the vertices of a gra...
SIAMCOMP
2002
14 years 9 months ago
2002
Given an edge-weighted graph where all weights are nonnegative reals, an edge reweighting is an assignment of nonnegative reals to edges such that, for each vertex, the sums of giv...
SIAMCOMP
2008
14 years 9 months ago
2008
We present a new algorithm to compute a subset S of vertices of a planar graph G whose removal partitions G into O(N/h) subgraphs of size O(h) and with boundary size O( h) each. ...
SIAMCOMP
2008
14 years 9 months ago
2008
Part I of this paper showed that the hidden subgroup problem over the symmetric group--including the special case relevant to Graph Isomorphism--cannot be efficiently solved by st...
SIAMCOMP
2008
14 years 9 months ago
2008
Bin packing is a well known problem which has a large number of applications. Classical bin packing is a simple model where all bins are identical. In the bin packing problem with...