1097 search results - page 4 / 220 » Testing Graph Isomorphism |
JAL
1998
14 years 9 months ago
1998
We describe a very general technique for generating families of combinatorial objects without isomorphs. It applies to almost any class of objects for which an inductive construct...
90
Voted
LICS
2010
IEEE
14 years 7 months ago
2010
IEEE
We prove that fixed-point logic with counting captures polynomial time on all classes of graphs with excluded minors. That is, for every class C of graphs such that some graph H is...
100
click to vote
CORR
2008
Springer
14 years 9 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...
EDBT
2008
ACM
14 years 11 months ago
2008
ACM
New graph structures where node labels are members of hierarchically organized ontologies or taxonomies have become commonplace in different domains, e.g., life sciences. It is a ...
170
click to vote
AMW
2011
14 years 1 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...