4 search results - page 1 / 1 » Minimum Face-Spanning Subgraphs of Plane Graphs |
WALCOM
2007
IEEE
14 years 2 days ago
2007
IEEE
WADS
1993
Springer
14 years 3 months ago
1993
Springer
The Minimum Weight Euclidean Matching (MWEM) problem is: given 2n point sites in the plane with Euclidean metric for interpoint distances, match the sites into n pairs so that the...
COMBINATORICS
2006
13 years 11 months ago
2006
Abstract. The geometric thickness of a graph G is the minimum integer k such that there is a straight line drawing of G with its edge set partitioned into k plane subgraphs. Eppste...
GD
2006
Springer
14 years 2 months ago
2006
Springer
The crossing number cr(G) of a graph G is the minimum number of crossings over all drawings of G in the plane. In 1993, Richter and Thomassen [RT93] conjectured that there is a co...