882 search results - page 109 / 177 » On the Hardness of Graph Isomorphism |
CPAIOR
2010
Springer
13 years 6 months ago
2010
Springer
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
EDBT
2009
ACM
14 years 3 months ago
2009
ACM
There has been an explosion of hyperlinked data in many domains, e.g., the biological Web. Expressive query languages and effective ranking techniques are required to convert this...
ICIP
2008
IEEE
14 years 3 months ago
2008
IEEE
We propose an algorithm for the binarization of document images degraded by uneven light distribution, based on the Markov Random Field modeling with Maximum A Posteriori probabil...
PPAM
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. We consider the problem of computing a weighted edge matching in a large graph using a parallel algorithm. This problem has application in several areas of combinatorial ...
WADS
2007
Springer
14 years 2 months ago
2007
Springer
Connectivity augmentation problems ask for adding a set of at most k edges whose insertion makes a given graph satisfy a specified connectivity property, such as bridge-connectivi...