6740 search results - page 272 / 1348 » An s -Hamiltonian Line Graph Problem |
108
click to vote
CIE
2008
Springer
15 years 2 months ago
2008
Springer
The values of a two-player zero-sum binary discounted game are characterized by a P-matrix linear complementarity problem (LCP). Simple formulas are given to describe the data of t...
105
Voted
DAM
2008
15 years 27 days 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...
100
click to vote
RSA
2006
15 years 22 days 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 ...
101
click to vote
CEC
2008
IEEE
15 years 7 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...
84
Voted
GECCO
2004
Springer
15 years 6 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...