398 search results - page 8 / 80 » Ant Algorithm for the Graph Matching Problem |
245
click to vote
ICPR
2010
IEEE
16 years 20 days ago
2010
IEEE
We propose a novel stochastic graph matching algorithm based on data-driven Markov Chain Monte Carlo (DDMCMC) sampling technique. The algorithm explores the solution space efficien...
158
Voted
STACS
2010
Springer
16 years 24 days 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 ...
191
Voted
TSMC
2010
15 years 15 days ago
2010
Abstract--The multimode resource-constrained projectscheduling problem with discounted cash flows (MRCPSPDCF) is important and challenging for project management. As the problem is...
157
click to vote
BPM
2009
Springer
16 years 12 days ago
2009
Springer
We investigate the problem of ranking all process models in a repository according to their similarity with respect to a given process model. We focus specifically on the applicat...
156
Voted
PCI
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. In this paper, we address the problem of computing a maximum-size subgraph of a P4-sparse graph which admits a perfect matching; in the case where the graph has a perfect...