2695 search results - page 29 / 539 » Learning Graph Matching |
115
Voted
STACS
2010
Springer
15 years 9 months ago
2010
Springer
Reachability and shortest path problems are NL-complete for general graphs. They are known to be in L for graphs of tree-width 2 [14]. However, for graphs of treewidth larger than ...
IPL
2008
15 years 1 months ago
2008
We prove that on prefix-recognizable graphs reachability is complete for deterministic exponential time matching the complexity of alternating reachability. Key words: Reachabilit...
DCC
2007
IEEE
16 years 1 months ago
2007
IEEE
This work is motivated by the necessity to automate the discovery of structure in vast and evergrowing collection of relational data commonly represented as graphs, for example ge...
99
Voted
EDBTW
2010
Springer
15 years 8 months ago
2010
Springer
Graph composition has applications in a variety of practical applications. In drug development, for instance, in order to understand possible drug interactions, one has to merge k...
117
Voted
3DPVT
2006
IEEE
15 years 8 months ago
2006
IEEE
A prerequisite to calibrated camera pose estimation is the construction of a camera neighborhood adjacency graph, a connected graph defining the pose neighbors of the camera set....