112 search results - page 1 / 23 » An Improved Bound on the Minimal Number of Edges in Color-Cr... |
COMBINATORICS
1998
13 years 4 months ago
1998
APPROX
2009
Springer
13 years 11 months ago
2009
Springer
We consider adding k shortcut edges (i.e. edges of small fixed length δ ≥ 0) to a graph so as to minimize the weighted average shortest path distance over all pairs of vertices...
SIAMDM
2010
12 years 11 months ago
2010
Bounds on the minimum degree and on the number of vertices attaining it have been much studied for finite edge-/vertex-minimally kconnected/k-edge-connected graphs. We give an ove...
SWAT
2004
Springer
13 years 10 months ago
2004
Springer
We study the following problem: Given a set V of n vertices and a set E of m edge pairs, we define a graph family G(V, E) as the set of graphs that have vertex set V and contain ...
ALGORITHMICA
2011
12 years 12 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...