6 search results - page 1 / 2 » Exact Bounds for Judicious Partitions of Graphs |
47
Voted
COMBINATORICA
1999
14 years 10 months ago
1999
ISCAS
2005
IEEE
15 years 4 months ago
2005
IEEE
: Assume that each vertex of a graph G is either a supply vertex or a demand vertex and is assigned a positive integer, called a supply or a demand. Each demand vertex can receive ...
LATIN
2010
Springer
15 years 5 months ago
2010
Springer
Many divide-and-conquer algorithms employ the fact that the vertex set of a graph of bounded treewidth can be separated in two roughly balanced subsets by removing a small subset o...
NETWORKS
2010
14 years 9 months ago
2010
Let G = (V, E, Q) be a undirected graph, where V is the set of vertices, E is the set of edges, and Q = {Q1, . . . , Qq} is a partition of V into q subsets. We refer to Q1, . . . ...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Cuckoo hashing with a stash is a robust high-performance hashing scheme that can be used in many real-life applications. It complements cuckoo hashing by adding a small stash stor...