Utkan Onur Candogan

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
Extracting structured subgraphs inside large graphs – often known as the planted subgraph problem – is a fundamental question that arises in a range of application domains. This problem is NP-hard in general, and as a result, significant efforts have been directed towards the development of tractable procedures that succeed on specific families of problem(More)
  • 1