306 search results - page 11 / 62 » Computing the Girth of a Planar Graph |
CCCG
2007
13 years 9 months ago
2007
In this paper we study the problem of computing homothetic triangle contact representations of planar graphs. Since not all planar graphs admit such a representation, we concentra...
ISAAC
2009
Springer
14 years 2 months ago
2009
Springer
SODA
2008
ACM
13 years 9 months ago
2008
ACM
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...