Extremal results for odd cycles in sparse pseudorandom graphs.
Elad Aigner-HorevHiêp HànMathias SchachtPublished in: Electron. Notes Discret. Math. (2013)
Keyphrases
- pseudorandom
- graph theory
- uniformly distributed
- random number
- secret key
- gaussian graphical models
- random numbers
- graph theoretic
- high dimensional
- graph matching
- graph mining
- graph representation
- directed acyclic
- stream cipher
- sparse representation
- sparse data
- complex networks
- encryption algorithm
- graph databases
- directed graph
- compressed sensing
- adjacency matrix
- real time
- graphical models
- social network analysis
- community structure
- fixed number
- complex structures
- graph model
- weighted graph