2487 search results - page 226 / 498 » Partitions of Graphs into Trees |
150
click to vote
COMGEO
2012
ACM
13 years 11 months ago
2012
ACM
A straight-line drawing of a plane graph G is a planar drawing of G, where each vertex is drawn as a point and each edge is drawn as a straight line segment. Given a set S of n poi...
183
click to vote
ICALP
2001
Springer
15 years 8 months ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
137
click to vote
GECCO
2004
Springer
15 years 9 months ago
2004
Springer
The prize-collecting Steiner tree problem on a graph with edge costs and vertex profits asks for a subtree minimizing the sum of the total cost of all edges in the subtree plus th...
139
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the gra...
130
click to vote
CIAC
2010
Springer
15 years 7 months ago
2010
Springer
Various forms of multicut problems are of great importance in the area of network design. In general, these problems are intractable. However, several parameters have been identifi...