6740 search results - page 220 / 1348 » An s -Hamiltonian Line Graph Problem |
PPAM
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. We consider the problem of computing a weighted edge matching in a large graph using a parallel algorithm. This problem has application in several areas of combinatorial ...
CP
2003
Springer
14 years 4 months ago
2003
Springer
This paper aims to show that Constraint Programming can be an efficient technique to solve a well-known combinatorial optimization problem: the search for a maximum clique in a gra...
INFORMS
2008
13 years 10 months ago
2008
We propose an exact solution method for a routing and capacity installation problem in networks. Given an input graph, the problem is to route traffic from a set of source nodes t...
ICALP
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. We give an fpt approximation algorithm for the directed vertex disjoint cycle problem. Given a directed graph G with n vertices and a positive integer k, the algorithm co...
ADHOCNOW
2003
Springer
14 years 4 months ago
2003
Springer
We consider topology control problems where the goal is to assign transmission powers to the nodes of an ad hoc network so as to induce graphs satisfying specific properties. The ...