Login / Signup

Some Problems on Approximate Counting in Graphs and Matroids.

Dominic Welsh
Published in: Bonn Workshop of Combinatorial Optimization (2008)
Keyphrases
  • solving problems
  • optimization problems
  • benchmark problems
  • problems involving
  • machine learning
  • clustering algorithm
  • application domains
  • exact solution
  • independent set
  • finding the shortest path