Login / Signup
The Complexity of the Vertex 3-Colorability Problem for Some Hereditary Classes Defined By 5-Vertex Forbidden Induced Subgraphs.
Dmitriy S. Malyshev
Published in:
Graphs Comb. (2017)
Keyphrases
</>
connected subgraphs
worst case
tractable cases
computational cost
space complexity
labeled graphs
learning algorithm
similarity measure
training data
association rules
user defined
directed graph