5473 search results - page 265 / 1095 » On the graph isomorphism problem |
229
click to vote
CVPR
2009
IEEE
17 years 2 months ago
2009
IEEE
Graph matching is an important problem in computer
vision. It is used in 2D and 3D object matching and recognition.
Despite its importance, there is little literature on
learnin...
167
click to vote
STACS
2010
Springer
16 years 2 months ago
2010
Springer
We study the problem of recognizing graph powers and computing roots of graphs. We provide a polynomial time recognition algorithm for r-th powers of graphs of girth at least 2r + ...
201
click to vote
CATS
2006
15 years 8 months ago
2006
We study the problem of orienting the edges of a weighted graph such that the maximum weighted outdegree of vertices is minimized. This problem, which has applications in the guar...
210
click to vote
SIMVIS
2004
15 years 8 months ago
2004
We describe a method to match 3D polygonal geometry models using their internal skeleton graphs. These graphs carry information about the overall shape of the model. In order to m...
171
click to vote
SODA
2004
ACM
15 years 8 months ago
2004
ACM
Given an undirected graph, finding either a minimum 2-edge-connected spanning subgraph or a minimum 2vertex-connected (biconnected) spanning subgraph is MaxSNP-hard. We show that ...