On the Size of the Giant Component in Inhomogeneous Random K-out Graphs.

Mansi Sood Osman Yagan

Published in: CoRR (2020)

Keyphrases

uniformly distributed
maximal cliques
graph matching
maximum clique
random graphs
standard deviation
graph theory
graph representation
graph theoretic
graph databases
uniform random
bounded treewidth
data sets
memory requirements
semi supervised
information systems
learning algorithm
neural network