Sciweavers

109 search results - page 14 / 22
» Hamiltonian Connected Line Graphs
Sort
View
ICPR
2008
IEEE
15 years 11 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
80
Voted
IPPS
2007
IEEE
15 years 4 months ago
A Multi-Level Parallel Implementation of a Program for Finding Frequent Patterns in a Large Sparse Graph
Graphs capture the essential elements of many problems broadly defined as searching or categorizing. With the rapid increase of data volumes from sensors, many application discipl...
Steve Reinhardt, George Karypis
DCG
2008
82views more  DCG 2008»
14 years 9 months ago
Schnyder Woods and Orthogonal Surfaces
In this paper we study connections between planar graphs, Schnyder woods, and orthogonal surfaces. Schnyder woods and the face counting approach have important applications in gra...
Stefan Felsner, Florian Zickfeld
90
Voted
GD
2009
Springer
15 years 2 months ago
Geometric Simultaneous Embeddings of a Graph and a Matching
The geometric simultaneous embedding problem asks whether two planar graphs on the same set of vertices in the plane can be drawn using straight lines, such that each graph is pla...
Sergio Cabello, Marc J. van Kreveld, Giuseppe Liot...
DICTA
2003
14 years 11 months ago
Two-Level Image Segmentation Based on Region and Edge Integration
Abstract. This paper introduces a two-level approach for image segmentation based on region and edge integration. Edges are first detected in the original image using a combinatio...
Qing Wu, Yizhou Yu