Fast periodic graph exploration with constant memory.
Leszek GasieniecRalf KlasingRussell A. MartinAlfredo NavarraXiaohui ZhangPublished in: J. Comput. Syst. Sci. (2008)
Keyphrases
- directed acyclic graph
- graph representation
- memory requirements
- memory space
- graph structure
- structured data
- random walk
- dependency graph
- graph matching
- graphical models
- graph clustering
- graph theory
- database systems
- link analysis
- stable set
- computing power
- graph based algorithm
- database
- graph mining
- weighted graph
- bipartite graph
- main memory
- connected components
- data structure
- social networks
- neural network