Login / Signup
Maximum directed cuts in acyclic digraphs.
Noga Alon
Béla Bollobás
András Gyárfás
Jenö Lehel
Alex 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