Sciweavers

906 search results - page 20 / 182
» Map graphs
Sort
View
TCS
2008
13 years 7 months ago
Succinct representations of planar maps
This paper addresses the problem of representing the connectivity information of geometric objects using as little memory as possible. As opposed to raw compression issues, the fo...
Luca Castelli Aleardi, Olivier Devillers, Gilles S...
CSCLP
2007
Springer
14 years 1 months ago
Combining Two Structured Domains for Modeling Various Graph Matching Problems
Abstract. Graph pattern matching is a central application in many fields. In various areas, the structure of the pattern can only be approximated and exact matching is then too ac...
Yves Deville, Grégoire Dooms, Stépha...
GD
1999
Springer
13 years 12 months ago
Planarity-Preserving Clustering and Embedding for Large Planar Graphs
In this paper we present a novel approach for cluster-based drawing of large planar graphs that maintains planarity. Our technique works for arbitrary planar graphs and produces a ...
Christian A. Duncan, Michael T. Goodrich, Stephen ...
ICDE
2006
IEEE
196views Database» more  ICDE 2006»
14 years 9 months ago
Closure-Tree: An Index Structure for Graph Queries
Graphs have become popular for modeling structured data. As a result, graph queries are becoming common and graph indexing has come to play an essential role in query processing. ...
Huahai He, Ambuj K. Singh
MFCS
2004
Springer
14 years 1 months ago
When Can You Play Positionally?
We consider infinite antagonistic games over finite graphs. We present conditions that, whenever satisfied by the payoff mapping, assure for both players positional (memoryless...
Hugo Gimbert, Wieslaw Zielonka