2487 search results - page 47 / 498 » Partitions of Graphs into Trees |
CEC
2008
IEEE
14 years 3 months ago
2008
IEEE
— In this paper, a new meta-method based on the physical nuclear process is presented. This meta-method called Fusion-Fission is applied to the two different class of graph parti...
PLDI
2003
ACM
14 years 2 months ago
2003
ACM
Clustered architectures are a solution to the bottleneck of centralized register files in superscalar and VLIW processors. The main challenge associated with clustered architectu...
EVOW
2006
Springer
14 years 27 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...
WADS
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. Algorithms or target functions for graph clustering rarely admit quality guarantees or optimal results in general. Based on properties of minimum-cut trees, a clustering ...
IPPS
2000
IEEE
14 years 1 months ago
2000
IEEE
Parallel solution of irregular problems require solving the graph partitioning problem. The extended eigenproblem appears as the solution of some relaxed formulations of the graph ...