Login / Signup
On complete strongly connected digraphs with the least number of 3-cycles.
M. Burzio
Jan Pelant
Published in:
Discret. Math. (1996)
Keyphrases
</>
directed graph
machine learning
undirected graph
information retrieval
data structure