1101 search results - page 85 / 221 » An Algorithm for the Graph Crossing Number Problem |
134
click to vote
SIAMDM
2008
15 years 4 months ago
2008
Let G be a connected graph, and let V and V two n-element subsets of its vertex set V (G). Imagine that we place a chip at each element of V and we want to move them into the posi...
150
click to vote
ISAAC
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. In this paper, we consider the problem of computing a minimum bending energy path (or MinBEP) in a simple corridor. Given a simple 2D corridor C bounded by straight line ...
157
click to vote
COCO
2008
Springer
15 years 6 months ago
2008
Springer
We introduce a simple game family, called Constraint Logic, where players reverse edges in a directed graph while satisfying vertex in-flow constraints. This game family can be in...
165
click to vote
ALGORITHMICA
2011
14 years 12 months ago
2011
Let V be a set of points in a d-dimensional lp-metric space. Let s, t ∈ V and let L be any real number. An L-bounded leg path from s to t is an ordered set of points which conne...
137
click to vote
AAIM
2009
Springer
15 years 11 months ago
2009
Springer
We introduce the s-Plex Editing problem generalizing the well-studied Cluster Editing problem, both being NP-hard and both being motivated by graph-based data clustering. Instead o...