736 search results - page 55 / 148 » Distinguishing geometric graphs |
EOR
2010
14 years 12 months ago
2010
Given an undirected graph G = (V, E) with a set V of vertices and a set E of edges, the graph coloring problem consists of partitioning all vertices into k independent sets and th...
ICCV
1998
IEEE
16 years 1 months ago
1998
IEEE
W e introduce a novel view-based object representation, called the saliency map graph (SMG), which captures the salient regions of an object view at multiple scales using a wavele...
124
click to vote
LION
2009
Springer
15 years 6 months ago
2009
Springer
Graph partitioning is a well-known optimization problem of great interest in theoretical and applied studies. Since the 1990s, many multilevel schemes have been introduced as a pra...
EVOW
2006
Springer
15 years 3 months ago
2006
Springer
The k-cut problem is an NP-complete problem which consists of finding a partition of a graph into k balanced parts such that the number of cut edges is minimized. Different algori...
CW
2002
IEEE
15 years 4 months ago
2002
IEEE
Metamorphosis between 3D objects is often the transformation between a pair of shapes that have the same topology. This paper presents a new model using Reeb graphs and their cont...