Some Observations on the Computational Complexity of Graph Accessibility Problem.
Jun TaruiSeinosuke TodaPublished in: COCOON (1999)
Keyphrases
- computational complexity
- directed graph
- graph structure
- graph matching
- graph representation
- structured data
- dependency graph
- high computational complexity
- directed acyclic graph
- graph theory
- computationally efficient
- np complete
- random walk
- special case
- weighted graph
- graph theoretic
- graph databases
- graph model
- bipartite graph
- decision problems
- computational efficiency
- hidden markov models
- np hard
- computational cost
- pairwise
- connected components
- spanning tree
- storage requirements
- website
- data mining
- graph search
- neural network