153 search results - page 4 / 31 » Minimum cost subpartitions in graphs |
WG
2000
Springer
15 years 1 months ago
2000
Springer
Several practical instances of network design and location theory problems require the network to satisfy multiple constraints. In this paper, we address graph-theoretic problems t...
106
Voted
FOCS
2000
IEEE
15 years 1 months ago
2000
IEEE
A bisection of a graph with n vertices is a partition of its vertices into two sets, each of size n/2. The bisection cost is the number of edges connecting the two sets. The proble...
119
Voted
COR
2008
14 years 9 months ago
2008
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...
88
Voted
SODA
1998
ACM
14 years 11 months ago
1998
ACM
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
97
Voted
DAM
2008
14 years 9 months ago
2008
For digraphs D and H, a mapping f : V (D)V (H) is a homomorphism of D to H if uv A(D) implies f(u)f(v) A(H). For a fixed directed or undirected graph H and an input graph D, the...