The Complexity of Modular Graph Automorphism.
Vikraman ArvindRichard BeigelAntoni LozanoPublished in: SIAM J. Comput. (2000)
Keyphrases
- graph representation
- worst case
- graph theoretic
- data structure
- computational complexity
- random walk
- space complexity
- connected components
- directed graph
- graph structure
- directed acyclic graph
- graph model
- stable set
- database
- graph based algorithm
- graph databases
- structured data
- upper bound
- pairwise
- information systems
- data mining
- real time