214 search results - page 10 / 43 » The node capacitated graph partitioning problem: A computati... |
97
Voted
4OR
2007
15 years 29 days ago
2007
Abstract We show that a well-known linearization technique initially proposed for quadratic assignment problems can be generalized to a broader class of quadratic 0-1 mixed-integer...
114
Voted
SC
2005
ACM
15 years 6 months ago
2005
ACM
Many emerging large-scale data science applications require searching large graphs distributed across multiple memories and processors. This paper presents a distributed breadth...
148
Voted
SODA
2010
ACM
15 years 10 months ago
2010
ACM
The quadratic assignment problem (QAP) is a central problem in combinatorial optimization. Several famous computationally hard tasks, such as graph matching, partitioning, and the...
UC
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. We study computational complexity of counting the fixed point configurations (FPs) in certain classes of graph automata viewed as discrete dynamical systems. We prove t...
121
Voted
CAIP
2005
Springer
15 years 6 months ago
2005
Springer
This paper presents a segmentation algorithm for gray-level images and addresses issues related to its performance on noisy images. It formulates an image segmentation problem as a...