Sciweavers

1977 search results - page 56 / 396
» The satisfactory partition problem
Sort
View
OL
2010
140views more  OL 2010»
15 years 21 days ago
Approximation algorithms for finding and partitioning unit-disk graphs into co-k-plexes
This article studies a degree-bounded generalization of independent sets called co-k-plexes. Constant factor approximation algorithms are developed for the maximum co-k-plex probl...
Balabhaskar Balasundaram, Shyam Sundar Chandramoul...
CP
2003
Springer
15 years 11 months ago
Semi-independent Partitioning: A Method for Bounding the Solution to COP's
In this paper we introduce a new method for bounding the solution to constraint optimization problems called semi-independent partitioning. We show that our method is a strict gene...
David Larkin
SYRCODIS
2008
136views Database» more  SYRCODIS 2008»
15 years 7 months ago
Stochastic Approach to Binary Matrix Partitioning for Phylogenetic Networks
In this research we introduce the problem of the binary matrix partitioning in a biological context. Our idea is to use SNP matrix to construct a set of phylogenetic networks to r...
Victoria Kusherbaeva, Nikolay Vyahhi
PAMI
2006
137views more  PAMI 2006»
15 years 5 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
ICCAD
1998
IEEE
65views Hardware» more  ICCAD 1998»
15 years 10 months ago
Multiway partitioning with pairwise movement
It is known to many researchers in the partitioning community that the recursive bipartitioning approach outperforms the direct non-recursive approach in solving the multiway part...
Jason Cong, Sung Kyu Lim