6740 search results - page 409 / 1348 » An s -Hamiltonian Line Graph Problem |
222
click to vote
ICCV
2007
IEEE
16 years 8 months ago
2007
IEEE
Graph matching techniques are widely used in pattern recognition problems such as scene description, finger print identification, or face recognition. In this paper, we put forwar...
138
click to vote
PERCOM
2006
ACM
16 years 6 months ago
2006
ACM
We address the problem of online route discovery for a class of graphs that can be embedded either in two or in three dimensional space. In two dimensions we propose the class of ...
167
click to vote
MFCS
2007
Springer
16 years 27 days ago
2007
Springer
The notion of distance constrained graph labelings, motivated by the Frequency Assignment Problem, reads as follows: A mapping from the vertex set of a graph G = (V, E) into an in...
158
click to vote
SAC
2006
ACM
16 years 21 days ago
2006
ACM
We propose a geometric constraint solving method based on connectivity analysis in graph theory, which can be used to decompose a well-constrained problem into some smaller ones i...
207
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
We show that Graph Isomorphism is in the complexity class SPP, and hence it is in ⊕P (in fact, it is in ModkP for each k ≥ 2). We derive this result as a corollary of a more g...