1115 search results - page 34 / 223 » Separating Shape Graphs |
86
Voted
DM
2006
14 years 11 months ago
2006
Any given graph can be embedded in a chordal graph by adding edges, and the resulting chordal graph is called a triangulation of the input graph. In this paper we study minimal tr...
84
Voted
ALGORITHMS
2010
14 years 8 months ago
2010
: Graph search algorithms have exploited graph extremities, such as the leaves of a tree and the simplicial vertices of a chordal graph. Recently, several well-known graph search a...
100
Voted
CIAC
2010
Springer
14 years 7 months ago
2010
Springer
We study the parameterized complexity of the problems of determining whether a graph contains a k-edge subgraph (k-vertex induced subgraph) that is a -graph for -graphs being one ...
ECCV
2002
Springer
16 years 24 days ago
2002
Springer
This paper examines issues arising in applying a previously developed edit-distance shock graph matching technique to indexing into large shape databases. This approach compares th...
ECCV
2004
Springer
16 years 25 days ago
2004
Springer
The traditional subspace-based approaches to segmentation (often referred to as multi-body factorization approaches) provide spatial clustering/segmentation by grouping together po...