384 search results - page 22 / 77 » On s-hamiltonian-connected line graphs |
147
click to vote
COSIT
2009
Springer
16 years 1 months ago
2009
Springer
Conceptual neighborhood graphs are similarity-based schemata of spatial/temporal relations. This paper proposes a semi-automated method for deriving a conceptual neighborhood graph...
170
click to vote
GD
2004
Springer
16 years 1 days ago
2004
Springer
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 ...
166
click to vote
GD
2003
Springer
15 years 12 months ago
2003
Springer
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 ...
137
click to vote
ICPR
2008
IEEE
16 years 7 months ago
2008
IEEE
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 ...
205
click to vote
HIPC
2007
Springer
16 years 24 days ago
2007
Springer
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...