On the Connectivity and Giant Component Size of Random K-out Graphs Under Randomly Deleted Nodes.
Eray Can ElumarMansi SoodOsman YaganPublished in: CoRR (2021)
Keyphrases
- directed graph
- connected components
- graph structure
- graph structures
- scale free networks
- weighted graph
- undirected graph
- strongly connected
- randomly chosen
- graph matching
- small world
- random graphs
- connected graphs
- fully connected
- attributed graphs
- real world networks
- uniform random
- graph theoretic
- edge weights
- small size
- computational complexity
- graph mining
- shortest path
- random walk
- spanning tree
- graph model
- graph theory
- bounded treewidth
- planar graphs
- software components
- binary images
- maximum clique
- wireless sensor networks