ALGORITHMICA
2011
13 years 6 months ago
2011
ALGORITHMICA
2011
13 years 6 months ago
2011
We show that computing the crossing number and the odd crossing number of a graph with a given rotation system is NP-complete. As a consequence we can show that many of the well-k...
ALGORITHMICA
2011
13 years 6 months ago
2011
ALGORITHMICA
2011
13 years 6 months ago
2011
ALGORITHMICA
2011
13 years 6 months ago
2011
ALGORITHMICA
2011
13 years 6 months ago
2011
Abstract Given k permutations of n elements, a k-tuple of intervals of these permutations consisting of the same set of elements is called a common interval. We present an algorith...
ALGORITHMICA
2011
13 years 6 months ago
2011
A nonplanar graph G is near-planar if it contains an edge e such that G−e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from diffe...
ALGORITHMICA
2011
13 years 6 months ago
2011
ALGORITHMICA
2011
13 years 6 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...
ALGORITHMICA
2011
13 years 6 months ago
2011
Let G = (V, E, w) be a directed graph, where w : V → R is an arbitrary weight function defined on its vertices. The bottleneck weight, or the capacity, of a path is the smalles...