Sciweavers

1952 search results - page 42 / 391
» Complete partitions of graphs
Sort
View
LION
2009
Springer
152views Optimization» more  LION 2009»
14 years 4 months ago
Comparison of Coarsening Schemes for Multilevel Graph Partitioning
Graph partitioning is a well-known optimization problem of great interest in theoretical and applied studies. Since the 1990s, many multilevel schemes have been introduced as a pra...
Cédric Chevalier, Ilya Safro
CEC
2008
IEEE
14 years 4 months ago
A new meta-method for graph partitioning
— 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...
Charles-Edmond Bichot
RSA
2010
89views more  RSA 2010»
13 years 8 months ago
Edge flows in the complete random-lengths network
Consider the complete n-vertex graph whose edge-lengths are independent exponentially distributed random variables. Simultaneously for each pair of vertices, put a constant flow ...
David J. Aldous, Shankar Bhamidi
PLDI
2003
ACM
14 years 3 months ago
Region-based hierarchical operation partitioning for multicluster processors
Clustered architectures are a solution to the bottleneck of centralized register files in superscalar and VLIW processors. The main challenge associated with clustered architectu...
Michael L. Chu, Kevin Fan, Scott A. Mahlke
JGT
2006
70views more  JGT 2006»
13 years 10 months ago
Vertex partitions of chordal graphs
Abstract: A k-tree is a chordal graph with no (k + 2)-clique. An -treepartition of a graph G is a vertex partition of G into `bags,' such that contracting each bag to a single...
David R. Wood