On the Connectivity and Giant Component Size of Random K-out Graphs Under Randomly Deleted Nodes.
Eray Can ElumarMansi SoodOsman YaganPublished in: ISIT (2021)
Keyphrases
- connected components
- directed graph
- undirected graph
- graph structure
- real world graphs
- graph structures
- strongly connected
- adjacency matrix
- small world
- weighted graph
- graph matching
- maximal cliques
- small size
- planar graphs
- random graphs
- network connectivity
- spanning tree
- complex networks
- scale free networks
- uniform random
- attributed graphs
- maximum clique
- subgraph isomorphism
- computational complexity
- randomly chosen
- fully connected
- graph theoretic
- graph model
- graph mining
- random walk
- np complete
- graphical models