Login / Signup
All Feedback Arc Sets of a Random Turán Tournament Have $\lfloor {n}/{k}\rfloor-{k}+1$ Disjoint k-Cliques (and This Is Tight).
Safwat Nassar
Raphael Yuster
Published in:
SIAM J. Discret. Math. (2021)
Keyphrases
</>
lower bound
ordered sets
objective function
upper bound
data mining
set theoretic
heuristic search
pairwise
active learning
state space
worst case
higher order
np complete
knowledge base
closed sets
genetic algorithm
real world