Sciweavers

1221 search results - page 20 / 245
» Balanced graph partitioning
Sort
View
GECCO
2006
Springer
147views Optimization» more  GECCO 2006»
14 years 13 days ago
Generalized cycle crossover for graph partitioning
We propose a new crossover that generalizes cycle crossover to permutations with repetitions and naturally suits partition problems. We tested it on graph partitioning problems ob...
Alberto Moraglio, Yong-Hyuk Kim, Yourim Yoon, Byun...
EOR
2010
82views more  EOR 2010»
13 years 8 months ago
Satisfactory graph partition, variants, and generalizations
The Satisfactory Partition problem asks for deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neighbor...
Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten
ISM
2006
IEEE
122views Multimedia» more  ISM 2006»
14 years 2 months ago
SuperGraph Visualization
Given a large social or computer network, how can we visualize it, find patterns, outliers, communities? Although several graph visualization tools exist, they cannot handle larg...
José Fernando Rodrigues Jr., Agma J. M. Tra...
COMBINATORICS
2002
85views more  COMBINATORICS 2002»
13 years 8 months ago
Parking Functions of Types A and B
The lattice of noncrossing partitions can be embedded into the Cayley graph of the symmetric group. This allows us to rederive connections between noncrossing partitions and parki...
Philippe Biane
CLUSTER
2002
IEEE
13 years 8 months ago
Adaptive System Sensitive Partitioning of AMR Applications on Heterogeneous Clusters
This paper presents the design and evaluation of an adaptive system sensitive partitioning and load balancing framework for distributed adaptive mesh re nement applications on het...
Shweta Sinha, Manish Parashar