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...

Celý popis

Podrobná bibliografia

Vydané v:	Computational complexity Ročník 26; číslo 3; s. 627 - 685
Hlavní autori:	Arvind, V., Köbler, Johannes, Rattan, Gaurav, Verbitsky, Oleg
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Cham Springer International Publishing 01.09.2017 Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!