1986 search results - page 26 / 398 » Path Separability of Graphs |
150
click to vote
ACCV
2009
Springer
15 years 6 months ago
2009
Springer
This paper proposes a novel graph matching algorithm based on skeletons and applies it to shape recognition based on object silhouettes. The main idea is to match the critical poin...
130
click to vote
ICML
2007
IEEE
16 years 17 days ago
2007
IEEE
Graph data such as chemical compounds and XML documents are getting more common in many application domains. A main difficulty of graph data processing lies in the intrinsic high ...
105
click to vote
DM
2008
14 years 11 months ago
2008
One of the basic results in graph theory is Dirac's theorem, that every graph of order n 3 and minimum degree n/2 is Hamiltonian. This may be restated as: if a graph of ord...
WADS
1993
Springer
15 years 3 months ago
1993
Springer
Our work is based on the pioneering work in sphere separators done by Miller, Teng, Vavasis et al, [8, 12], who gave efficient static (fixed input) algorithms for finding sphere ...
CPAIOR
2007
Springer
15 years 6 months ago
2007
Springer
Given a directed graph G, the K node-disjoint paths problem consists in finding a partition of G into K node-disjoint paths, such that each path ends up in a given subset of nodes...