SIGMOD
2011
ACM
12 years 7 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...
AMW
2011
12 years 8 months ago
2011
Abstract. We consider the problem of checking equivalence of conjunctive queries with inequalities under bag (multiset) semantics. The problem is known to be decidable in pspace an...
TGC
2010
Springer
13 years 2 months ago
2010
Springer
We define an algebraic theory of hierarchical graphs, whose axioms characterise graph isomorphism: two terms are equated exactly when they represent the same graph. Our algebra can...
ICPR
2010
IEEE
13 years 3 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...
CC
2006
Springer
13 years 4 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...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
We relate the graph isomorphism problem to the solvability of certain systems of linear equations and linear inequalities. The number of these equations and inequalities is relate...
CIE
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. Graph isomorphism (GI) is one of the few remaining problems in NP whose complexity status couldn't be solved by classifying it as being either NP-complete or solvabl...
STACS
1992
Springer
13 years 8 months ago
1992
Springer
We show that the graph isomorphism problem is low for PP and for C=P, i.e., it does not provide a PP or C=P computation with any additional power when used as an oracle. Furthermor...
MFCS
2009
Springer
13 years 9 months ago
2009
Springer
In this paper we first explore the group theoretic techniques developed for graph isomorphism. We specifically discuss the techniques developed by Luks for solving constrained v...
FOCS
2002
IEEE
13 years 9 months ago
2002
IEEE
We show that Graph Isomorphism is in the complexity class SPP, and hence it is in ⊕P (in fact, it is in ModkP for each k ≥ 2). We derive this result as a corollary of a more g...