Login / Signup
The class of ( P 7 , C 4 , C 5 ) -free graphs: Decomposition, algorithms, and χ -boundedness.
Kathie Cameron
Shenwei Huang
Irena Penev
Vaidy Sivaraman
Published in:
J. Graph Theory (2020)
Keyphrases
</>
learning algorithm
computational complexity
computational cost
theoretical analysis
neural network
data mining
machine learning
decision trees
lower bound
multi class
simulated annealing
sufficient conditions
computationally efficient
orders of magnitude
graph isomorphism