731 search results - page 48 / 147 » Reductions to Graph Isomorphism |
SIGMOD
2011
ACM
12 years 11 months ago
2011
ACM
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
JSYML
2011
13 years 3 months ago
2011
Abstract. Louveau and Rosendal [5] have shown that the relation of biembeddability for countable graphs as well as for many other natural classes of countable structures is complet...
FLAIRS
2006
13 years 10 months ago
2006
Inexact graph matching has become an important research area because it is used to find similarities among objects in several real domains such as chemical and biological compound...
SSPR
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. In order to use structural techniques from graph-based pattern recognition, a first necessary step consists in extracting a graph in an automatic way from an image. We pr...
CORR
2002
Springer
13 years 8 months ago
2002
Springer
Dealing with the NP-complete Dominating Set problem on graphs, we demonstrate the power of data reduction by preprocessing from a theoretical as well as a practical side. In parti...