• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

The competition number of a graph whose holes do not overlap much.

Suh-Ryung KimJung Yeun LeeYoshio Sano
Published in: Discret. Appl. Math. (2010)
Keyphrases
  • small number
  • maximum number
  • decision trees
  • data sets
  • graph theory
  • fixed number
  • database
  • similarity measure
  • computational complexity
  • np hard
  • probabilistic model
  • random walk