Graphs of Large Linear Size Are Antimagic.

Published in: J. Graph Theory (2016)

Keyphrases

series parallel
graph matching
graph theoretic
computational complexity
maximum clique
small size
maximal cliques
data sets
knowledge base
pattern recognition
standard deviation
graph databases
bounded treewidth
linear functions
uniform random