On the Robustness, Connectivity and Giant Component Size of Random K-out Graphs.

Eray Can Elumar Mansi Sood Osman Yagan

Published in: CoRR (2023)

Keyphrases

connected components
small size
feature selection
d objects
memory requirements
graph matching
graph model
high robustness
network size
maximal cliques
maximum clique
database
series parallel
bounded treewidth
topological properties
undirected graph
np hard