Login / Signup

On the complexity of the identifiable subgraph problem, revisited.

Stefan KratschMartin Milanic
Published in: Discret. Appl. Math. (2017)
Keyphrases
  • lower complexity
  • neural network
  • decision making
  • graph mining
  • machine learning
  • clustering algorithm
  • database systems
  • search space
  • upper bound
  • worst case
  • space complexity