On the Computational Complexity of Graph Closures.
Angelo MontiPublished in: Inf. Process. Lett. (1996)
Keyphrases
- computational complexity
- graph representation
- directed graph
- graph model
- random walk
- graph theory
- connected components
- low complexity
- directed acyclic graph
- np hard
- spanning tree
- memory requirements
- high computational complexity
- graph clustering
- graph theoretic
- graph databases
- graph matching
- computational efficiency
- structured data
- bipartite graph
- neural network
- decision problems
- graph data
- computationally efficient
- search algorithm