214 search results - page 3 / 43 » The node capacitated graph partitioning problem: A computati... |
GD
2006
Springer
14 years 2 months ago
2006
Springer
In this paper, we study the k-tree partition problem which is a partition of the set of edges of a graph into k edge-disjoint trees. This problem occurs at several places with appl...
ESA
2009
Springer
14 years 5 months ago
2009
Springer
Finding sparse cuts is an important tool for analyzing large graphs that arise in practice, such as the web graph, online social communities, and VLSI circuits. When dealing with s...
ALGORITHMICA
2008
13 years 11 months ago
2008
Grid computing systems pool together the resources of many workstations to create a virtual computing reservoir. Users can "draw" resources using a pay-as-you-go model, c...
JGAA
2000
13 years 11 months ago
2000
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that eac...
ICNP
2005
IEEE
14 years 4 months ago
2005
IEEE
In this paper, we analyze the problem of network disconnection in the context of large-scale P2P networks and understand how both static and dynamic patterns of node failure affec...