320 search results - page 11 / 64 » Parity Problems in Planar Graphs |
GD
2006
Springer
13 years 11 months ago
2006
Springer
In this paper, we study the k-tree partition problem which is a partition of the set of edges of a graph into k edge-disjoint trees. This problem occurs at several places with appl...
COR
2008
13 years 7 months ago
2008
Consider the following heuristic for planar Euclidean instances of the Traveling Salesman Problem (TSP): select a subset of the edges which induces a planar graph, and solve eithe...
ICALP
2001
Springer
14 years 6 days ago
2001
Springer
ALGORITHMICA
2000
13 years 7 months ago
2000
CORR
2002
Springer
13 years 7 months ago
2002
Springer
Traditional representations of graphs and their duals suggest the requirement that the dual vertices should be placed inside their corresponding primal faces, and the edges of the ...