Login / Signup
Hardness results for three kinds of colored connections of graphs.
Zhong Huang
Xueliang Li
Published in:
CoRR (2020)
Keyphrases
</>
graph matching
graph theoretic
graph representation
directed graph
data sets
computational complexity
graph theory
learning theory
graph structures
np complete
real time
graph mining
undirected graph
worst case
np hard
series parallel
structured objects