Near-perfect clique-factors in sparse pseudorandom graphs.
Jie HanYoshiharu KohayakawaYury PersonPublished in: Comb. Probab. Comput. (2021)
Keyphrases
- pseudorandom
- uniformly distributed
- independent set
- maximum clique
- secret key
- random number
- sparse representation
- random numbers
- graph properties
- sparse data
- encryption algorithm
- graph theoretic
- quasi cliques
- gaussian graphical models
- graph representation
- factors affecting
- graph structure
- maximum weight
- stream cipher
- audio signal
- directed acyclic
- maximum independent set
- data analysis
- graph databases
- bipartite graph
- high dimensional