Abstract | ||
---|---|---|
Let V = {x1,...,xn} be a set of variables that range over a set of values D = {d1,...,dq}. A constraint is an expression of the type $R(x_{i_1},\ldots,x_{i_r})$, ... |
Year | DOI | Venue |
---|---|---|
2009 | 10.1007/978-3-642-03816-7_46 | MFCS |
Keywords | DocType | Volume |
k-trees,graph isomorphism,isomorphism problem,logspace completeness.,graph canonization,values d,space com- plexity,lower bound,upper bound | Journal | 16 |
ISSN | Citations | PageRank |
0302-9743 | 5 | 0.42 |
References | Authors | |
29 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Johannes Köbler | 1 | 580 | 46.51 |
Sebastian Kuhnert | 2 | 36 | 6.52 |