k-Colorability is Graph Automaton Recognizable.

Antonios Kalampakas

Published in: CoRR (2014)

Keyphrases

finite automata
graph representation
structured data
graph based algorithm
directed acyclic graph
random walk
directed graph
phase transition
graph theory
graph partitioning
spanning tree
stable set
np hard
graph databases
graph model
graph mining
weighted graph
bipartite graph