A Construction for Clique-Free Pseudorandom Graphs.
Anurag BishnoiFerdinand IhringerValentina PepePublished in: Comb. (2020)
Keyphrases
- pseudorandom
- uniformly distributed
- random number
- independent set
- maximum clique
- graph theoretic
- graph properties
- graph theory
- quasi cliques
- random numbers
- maximum independent set
- encryption algorithm
- secret key
- construction process
- branch and bound algorithm
- directed graph
- data sets
- graph model
- graph mining
- weighted graph
- bipartite graph
- graph matching
- stream cipher
- nearest neighbor
- data structure