Login / Signup
Divide and conquer martingales and the number of triangles in a random graph.
Jeong Han Kim
Van H. Vu
Published in:
Random Struct. Algorithms (2004)
Keyphrases
</>
random graphs
computational complexity
undirected graph
graph theoretic
np hard