Graph Isomorphism, Color Refinement, and Compactness

Color refinement is a classical technique used to show that two given graphs G and H are non-isomorphic; it is very efficient, although it does not succeed on all graphs. We call a graph G amenable to color refinement if the color refinement procedure succeeds in distinguishing G from any non-isomor...

Full description

Bibliographic Details

Published in:	Computational complexity Vol. 26; no. 3; pp. 627 - 685
Main Authors:	Arvind, V., Köbler, Johannes, Rattan, Gaurav, Verbitsky, Oleg
Format:	Journal Article
Language:	English
Published:	Cham Springer International Publishing 01.09.2017 Springer Nature B.V
Subjects:	Algorithm Analysis and Problem Complexity Automorphisms Color Combinatorial analysis Computational Mathematics and Numerical Analysis Computer Science Graph theory Graphs Isomorphism Linear programming color refinement linear programming relaxation Graph Isomorphism 68Q25 Analysis of algorithms and problem complexity polytope of fractional automorphisms
ISSN:	1016-3328, 1420-8954
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!