1633 search results - page 25 / 327 » Planar Map Graphs |
LATIN
2010
Springer
14 years 2 months ago
2010
Springer
In this paper, we consider the problem of representing graphs by polygons whose sides touch. We show that at least six sides per polygon are necessary by constructing a class of pl...
GD
2003
Springer
14 years 27 days ago
2003
Springer
Given two different drawings of a planar graph we consider the problem of morphing one drawing into the other. We designed and implemented an algorithm for intersection-free morph...
COCO
2006
Springer
13 years 11 months ago
2006
Springer
We study the complexity of restricted versions of s-t-connectivity, which is the standard complete problem for NL. In particular, we focus on different classes of planar graphs, o...
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...
PRIS
2001
13 years 9 months ago
2001
This paper presents an approach for content-based image retrieval via isotropic and anisotropic mappings. Isotropic mappings are defined to be mappings invariant to the action of t...