Login / Signup

On size-constrained minimum s-t cut problems and size-constrained dense subgraph problems.

Wenbin ChenNagiza F. SamatovaMatthias F. StallmannWilliam HendrixWeiqin Ying
Published in: Theor. Comput. Sci. (2016)
Keyphrases
  • real time
  • computational complexity
  • decision problems
  • data sets
  • neural network
  • learning algorithm
  • clustering algorithm
  • optimal solution
  • np complete
  • problems involving
  • computationally infeasible