6740 search results - page 104 / 1348 » An s -Hamiltonian Line Graph Problem |
DNA
2004
Springer
14 years 3 months ago
2004
Springer
Most DNA computing algorithms for mathematical problems start with combinatorial generation of an initial pool. Several methods for initialpool generation have been proposed, inclu...
GECCO
2009
Springer
14 years 4 months ago
2009
Springer
Hyper-heuristics can be thought of as “heuristics to choose heuristics”. They are concerned with adaptively finding solution methods, rather than directly producing a solutio...
CPC
2007
13 years 10 months ago
2007
Abstract. This paper is devoted to an online variant of the minimum spanning tree problem in randomly weighted graphs. We assume that the input graph is complete and the edge weigh...
FOCS
2009
IEEE
14 years 4 months ago
2009
IEEE
— Linial, London and Rabinovich [16] and Aumann and Rabani [3] proved that the min-cut max-flow ratio for general maximum concurrent flow problems (when there are k commodities...
CIMCA
2005
IEEE
14 years 3 months ago
2005
IEEE
Minimal Switching Graph (MSG) is a graphical model for the constrained via minimization problem — a combinatorial optimization problem in integrated circuit design automation. F...