New Time-Space Upperbounds for Directed Reachability in High-genus and H-minor-free Graphs.
Diptarka ChakrabortyAduri PavanRaghunath TewariN. V. VinodchandranLin F. YangPublished in: FSTTCS (2014)
Keyphrases
- graph matching
- space time
- low dimensional
- high precision
- spectral decomposition
- genetic algorithm
- series parallel
- graph theoretic
- higher dimensional
- complex structures
- graph mining
- graph structure
- principal component analysis
- high dimensional
- pattern recognition
- wide range
- optimal solution
- reinforcement learning
- similarity measure
- social networks