Near-perfect clique-factors in sparse pseudorandom graphs.
Jie HanYoshiharu KohayakawaYury PersonPublished in: Electron. Notes Discret. Math. (2018)
Keyphrases
- social networks
- pseudorandom
- uniformly distributed
- independent set
- random number
- secret key
- random numbers
- maximum clique
- graph matching
- quasi cliques
- graph properties
- gaussian graphical models
- factors that influence
- graph theory
- factors affecting
- directed acyclic
- sparse data
- high dimensional
- maximum independent set
- graphical models
- compressive sensing
- sparse representation
- graph theoretic
- graph structure
- adjacency matrix
- encryption algorithm
- maximum weight
- data sets
- data analysis
- graph representation
- graph databases
- weighted graph