Tight lower and upper bounds for the complexity of canonical colour refinement

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 8125 LNCS, Issue , 2013, Pages 145-156

  Berkholz, Christoph ^a   Bonsma, Paul ^b   Grohe, Martin ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

^b UNIVERSITY OF TWENTE   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMORPHISMS; GRAPH ISOMORPHISM; LOWER AND UPPER BOUNDS; REFINEMENT ALGORITHMS;

ALGORITHMS; GRAPH THEORY;

COLOR;

EID: 84884316142     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-40450-4_13     Document Type: Conference Paper

References (12)

1. Babai, L.: Moderately exponential bound for graph isomorphism. In: Gécseg, F. (ed.) FCT 1981. LNCS, vol. 117, pp. 34-50. Springer, Heidelberg (1981)
2. Babai, L., Erdös, P., Selkow, S.: Random graph isomorphism. SIAM Journal on Computing 9, 628-635 (1980)
3. Babai, L., Luks, E.: Canonical labeling of graphs. In: Proc. STOC 1983, pp. 171-183 (1983)
4. Cai, J., Fürer, M., Immerman, N.: An optimal lower bound on the number of variables for graph identifications. Combinatorica 12(4), 389-410 (1992)
5. 2|V|). Theoretical Computer Science 19(1), 85-98 (1982)
6. Darga, P., Liffiton, M., Sakallah, K., Markov, I.: Exploiting structure in symmetry detection for CNF. In: Proc. DAG 2004, pp. 530-534 (2004)
7. Hopcroft, J.: An n log n algorithm for minimizing states in a finite automaton. In: Kohavi, Z., Paz, A. (eds.) Theory of Machines and Computations, pp. 189-196. Academic Press (1971)
8. Junttila, T., Kaski, P.: Engineering an efficient canonical labeling tool for large and sparse graphs. In: Proc. ALENEX 2007, pp. 135-149 (2007)
9. McKay, B.: Practical graph isomorphism. Congressus Numerantium 30, 45-87 (1981)
10. McKay, B.: Nauty users guide (version 2.4). Computer Science Dept., Australian National University (2007)
11. Paige, R., Tarjan, R.: Three partition refinement algorithms. SIAM Journal on Computing 16(6), 973-989 (1987)
12. Piperno, A.: Search space contraction in canonical labeling of graphs. arXiv preprint arXiv:0804.4881v2 (2011)