Login / Signup
Improper coloring of sparse graphs with a given girth, I: (0, 1)-colorings of triangle-free graphs.
Jaehoon Kim
Alexandr V. Kostochka
Xuding Zhu
Published in:
Eur. J. Comb. (2014)
Keyphrases
</>
graph representation
graph matching
graph theory
directed graph
subgraph isomorphism
graph databases
graph structure
neural network
simulated annealing
graphical models
shortest path
evolutionary algorithm
high dimensional
feature space
weighted graph
data structure
objective function
graph theoretic
small world