1327 search results - page 41 / 266 » Path following algorithm for the graph matching problem |
131
Voted
CC
2005
Springer
15 years 3 months ago
2005
Springer
Various techniques for the navigation and matching of data structures using path expressions have been the subject of extensive investigations. No matter whether such techniques ar...
119
Voted
LION
2009
Springer
15 years 8 months ago
2009
Springer
A very undesirable behavior of any heuristic algorithm is to be stuck in some specific parts of the search space, in particular in the basins of attraction of the local optima. Wh...
112
click to vote
DLOG
2004
15 years 3 months ago
2004
Interoperability among systems using different term vocabularies requires mappings between them. Matching applications generate these mappings. When the matching process utilizes ...
121
click to vote
CIAC
1997
Springer
15 years 5 months ago
1997
Springer
In this paper, we study the Graph Isomorphism problem on graphs of bounded treewidth, bounded degree or bounded bandwidth. Graph Isomorphism can be solved in polynomial time for g...
127
click to vote
ANTSW
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. We consider the problem of finding and maintaining communication paths in wireless mobile ad hoc networks (MANET). We consider this problem as a bi-objective problem when...