Login / Signup

On the Complexity of Scaffolding Problems: From Cliques to Sparse Graphs.

Mathias WellerAnnie ChateauRodolphe Giroudeau
Published in: COCOA (2015)
Keyphrases
  • decision problems
  • computational complexity
  • graph structure
  • maximal cliques
  • polynomial time complexity
  • data sets
  • feature selection
  • np complete
  • concept maps
  • tractable cases
  • finding the shortest path