882 search results - page 7 / 177 » On the Hardness of Graph Isomorphism |
RELMICS
2000
Springer
13 years 11 months ago
2000
Springer
This paper presents a novel approach to the problem of finding all subgraph isomorphisms of a (pattern) graph into another (target) graph. A relational formulation of the problem, ...
CC
2006
Springer
13 years 7 months ago
2006
Springer
Abstract. We study the complexity of the isomorphism and automorphism problems for finite rings. We show that both integer factorization and graph isomorphism reduce to the problem...
ICPR
2010
IEEE
13 years 6 months ago
2010
IEEE
In this paper we propose a conductance electrical model to represent weighted undirected graphs that allows us to efficiently compute approximate graph isomorphism in large graph...
GD
1999
Springer
13 years 11 months ago
1999
Springer
The isomorphic subgraph problem is finding two disjoint subgraphs of a graph which coincide on at least k edges. The graph is partitioned into a subgraph, its copy, and a remaind...
SIGMOD
2011
ACM
12 years 10 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...