5889 search results - page 226 / 1178 » Graph Layout Problems |
187
click to vote
DAM
2008
15 years 6 months ago
2008
The paper studies crown reductions for the Minimum Weighted Vertex Cover problem introduced recently in the unweighted case by Fellows et al. [Blow-Ups, Win/Win's and crown r...
166
click to vote
RSA
2006
15 years 6 months ago
2006
Abstract. We study two natural models of randomly generated constraint satisfaction problems. We determine how quickly the domain size must grow with n to ensure that these models ...
171
click to vote
CEC
2008
IEEE
16 years 1 months ago
2008
IEEE
— 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...
151
click to vote
GECCO
2004
Springer
15 years 12 months ago
2004
Springer
This paper gives an algorithm for finding the minimum weight tree having k edges in an edge weighted graph. The algorithm combines a search and optimization technique based on phe...
177
click to vote
IPCO
1993
15 years 7 months ago
1993
The survivable network design problem (SNDP) is to construct a minimum-cost subgraph satisfying certain given edge-connectivity requirements. The first polynomial-time approximati...