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

Maximum directed cuts in acyclic digraphs.

Noga AlonBéla BollobásAndrás GyárfásJenö LehelAlex D. Scott
Published in: J. Graph Theory (2007)
Keyphrases
  • np complete
  • directed graph
  • data sets
  • np hard
  • equivalence classes
  • database
  • real world
  • machine learning
  • information retrieval
  • artificial intelligence
  • hidden markov models
  • dynamical systems
  • database schemes