Login / Signup
Complexity of Graph Embeddability Problems.
Claude Benzaken
S. Foldes
Published in:
Theor. Comput. Sci. (1981)
Keyphrases
</>
decision problems
np complete
data sets
image segmentation
worst case
weighted graph
polynomial hierarchy
polynomial time complexity
data mining
learning algorithm
computational complexity
np hard
graph theory
solving problems
causal graph
tractable cases