Sciweavers

1221 search results - page 41 / 245
» Balanced graph partitioning
Sort
View
DELTA
2002
IEEE
14 years 1 months ago
Minimization and Partitioning Method Reducing Input Sets
The article describes a new Boolean minimization and single-level partitioning method based on the BOOM minimization system [6]. The minimization is performed with respect to the ...
Jan Hlavicka, Petr Fiser
JCT
2006
81views more  JCT 2006»
13 years 8 months ago
Hyperplane partitions and difference systems of sets
Difference Systems of Sets (DSS) are combinatorial configurations that arise in connection with code synchronization. This paper gives new constructions of DSS obtained from parti...
Ryoh Fuji-Hara, Akihiro Munemasa, Vladimir D. Tonc...
DAM
2008
123views more  DAM 2008»
13 years 9 months ago
Polar cographs
Polar graphs are a natural extension of some classes of graphs like bipartite graphs, split graphs and complements of bipartite graphs. A graph is (s, k)-polar if there exists a pa...
Tinaz Ekim, Nadimpalli V. R. Mahadev, Dominique de...
PAMI
2006
137views more  PAMI 2006»
13 years 8 months ago
Isoperimetric Graph Partitioning for Image Segmentation
Spectral graph partitioning provides a powerful approach to image segmentation. We introduce an alternate idea that finds partitions with a small isoperimetric constant, requiring ...
Leo Grady, Eric L. Schwartz
EC
2007
118views ECommerce» more  EC 2007»
13 years 8 months ago
Geometric Crossovers for Multiway Graph Partitioning
Geometric crossover is a representation-independent generalization of the traditional crossover defined using the distance of the solution space. By choosing a distance firmly r...
Alberto Moraglio, Yong-Hyuk Kim, Yourim Yoon, Byun...