Extremal results for odd cycles in sparse pseudorandom graphs.
Elad Aigner-HorevHiêp HànMathias SchachtPublished in: Comb. (2014)
Keyphrases
- pseudorandom
- graph theory
- uniformly distributed
- random number
- secret key
- random numbers
- graph matching
- sparse data
- graph theoretic
- high dimensional
- graph structure
- directed acyclic
- gaussian graphical models
- undirected graph
- graph model
- graph mining
- compressive sensing
- compressed sensing
- stream cipher
- graph representation
- random graphs
- social network analysis
- encryption algorithm
- sparse matrix
- sparse representation
- real time