Login / Signup

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

Mansi SoodOsman Yagan
Published in: CDC (2020)
Keyphrases
  • markov chain
  • connected components
  • maximal cliques
  • data structure
  • computational complexity
  • graph matching
  • graph databases
  • small size
  • data sets
  • standard deviation
  • bounded treewidth
  • uniform random