Sciweavers

384 search results - page 22 / 77
» On s-hamiltonian-connected line graphs
Sort
View
COSIT
2009
Springer
129views GIS» more  COSIT 2009»
14 years 3 months ago
Semi-automated Derivation of Conceptual Neighborhood Graphs of Topological Relations
Conceptual neighborhood graphs are similarity-based schemata of spatial/temporal relations. This paper proposes a semi-automated method for deriving a conceptual neighborhood graph...
Yohei Kurata
GD
2004
Springer
14 years 2 months ago
QUOGGLES: Query On Graphs - A Graphical Largely Extensible System
We describe the query and data processing language QUOGGLES which is particularly designed for the application on graphs. It uses a pipeline-like technique known from command line ...
Paul Holleis, Franz-Josef Brandenburg
GD
2003
Springer
14 years 1 months ago
Track Drawings of Graphs with Constant Queue Number
A k-track drawing is a crossing-free 3D straight-line drawing of a graph G on a set of k parallel lines called tracks. The minimum value of k for which G admits a k-track drawing ...
Emilio Di Giacomo, Henk Meijer
ICPR
2008
IEEE
14 years 9 months ago
Object localization using affine invariant substructure constraints
In this paper we propose a novel method for generic object localization. The method is based on modeling the object as a graph at two levels: a local substructural representation ...
Ahmed M. Elgammal, Ishani Chakraborty
HIPC
2007
Springer
14 years 2 months ago
Accelerating Large Graph Algorithms on the GPU Using CUDA
Abstract. Large graphs involving millions of vertices are common in many practical applications and are challenging to process. Practical-time implementations using high-end comput...
Pawan Harish, P. J. Narayanan