6740 search results - page 223 / 1348 » An s -Hamiltonian Line Graph Problem |
FSTTCS
2006
Springer
14 years 2 months ago
2006
Springer
Given a set P of n points on the real line and a (potentially innite) family of functions, we investigate the problem of nding a small (weighted) subset S P, such that for any f ...
CCCG
2010
14 years 8 days ago
2010
We examine the problem of pushing all the points of a planar region into one point using parallel sweeps of an infinite line, minimizing the sum of the lengths of the sweep vector...
ICALP
2009
Springer
14 years 11 months ago
2009
Springer
We improve the approximation ratios for two optimization problems in planar graphs. For node-weighted Steiner tree, a classical network-optimization problem, the best achievable ap...
PAMI
2006
13 years 10 months ago
2006
A binary linear programming formulation of the graph edit distance for unweighted, undirected graphs with vertex attributes is derived and applied to a graph recognition problem. ...
MFCS
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. We address the strategy problem for parity games with partial information and observable colors, played on finite graphs of bounded graph complexity. We consider several...