6740 search results - page 234 / 1348 » An s -Hamiltonian Line Graph Problem |
119
Voted
CORR
2011
Springer
14 years 4 months ago
2011
Springer
A hitting set for a collection of sets is a set that has a nonempty intersection with each set in the collection; the hitting set problem is to find a hitting set of minimum card...
90
Voted
ANOR
2002
15 years 16 days ago
2002
Abstract: We define events so as to reduce the number of events and decision variables needed for modeling batchscheduling problems such as described in [Westenberger and Kallrath ...
ICTCS
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. We study efficient exact algorithms for several problems including Vertex Bipartization, Feedback Vertex Set, 3-Hitting Set, Max Cut in graphs with maximum degree at most...
88
Voted
IPPS
1998
IEEE
15 years 5 months ago
1998
IEEE
Given an (undirected) graph G = V; E; a clique of G is a subset of vertices in which every pair is connected by an edge. The problem of finding a clique of maximum size is a class...
114
click to vote
ISAAC
1998
Springer
15 years 4 months ago
1998
Springer
Let G = (V; E; w) be an undirected graph with nonnegative edge length function w and nonnegative vertex weight function r. The optimal product-requirement communication spanning t...