6740 search results - page 235 / 1348 » An s -Hamiltonian Line Graph Problem |
79
Voted
COCOA
2008
Springer
15 years 2 months ago
2008
Springer
In the Connected Facility Location(ConFL) problem, we are given a graph G = (V, E) with nonnegative edge cost ce on the edges, a set of facilities F V , a set of demands, i.e., cl...
APPML
2006
15 years 22 days ago
2006
We show that a combinatorial question which has been studied in connection with lower bounds for the knapsack problem by Brimkov and Dantchev (2001) is related to threshold graphs...
104
Voted
IANDC
2008
15 years 22 days ago
2008
We consider a permutation-based model for the gene assembly process in ciliates. We give a procedure to decide whether a given micronuclear molecules may be assembled by using onl...
ALGORITHMICA
2004
15 years 17 days ago
2004
We consider the Connected Facility Location problem. We are given a graph G = (V, E) with costs {ce} on the edges, a set of facilities F V , and a set of clients D V . Facility ...
115
Voted
DAM
2000
15 years 15 days ago
2000
Given an undirected graph with a nonnegative weight on each edge, the shortest total path length spanning tree problem is to