244 search results - page 18 / 49 » Balanced Cayley graphs and balanced planar graphs |
EVOW
2006
Springer
14 years 23 days ago
2006
Springer
The k-cut problem is an NP-complete problem which consists of finding a partition of a graph into k balanced parts such that the number of cut edges is minimized. Different algori...
AE
2003
Springer
14 years 2 months ago
2003
Springer
Abstract. The graph partitioning problem consists of dividing the vertices of a graph into a set of balanced parts, such that the number of edges connecting vertices in different ...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
We present a general method of designing fast approximation algorithms for cut-based minimization problems in undirected graphs. In particular, we develop a technique that given a...
EUROPAR
2009
Springer
14 years 1 months ago
2009
Springer
A high-level understanding of how an application executes and which performance characteristics it exhibits is essential in many areas of high performance computing, such as applic...
NETWORKS
2010
13 years 7 months ago
2010
Maˇnuch and Stacho [7] introduced the problem of designing f-tolerant routings in optical networks, i.e., routings which still satisfy the given requests even if f failures occur...