The computational complexity of graph problems with succinct multigraph representation.
Marek KarpinskiKlaus W. WagnerPublished in: ZOR Methods Model. Oper. Res. (1988)
Keyphrases
- computational complexity
- graph representation
- np complete
- decision problems
- shortest path problem
- optimization problems
- random walk
- computationally efficient
- bit rate
- solving problems
- graph structure
- bipartite graph
- directed graph
- rate distortion
- application domains
- neural network
- special case
- high dimensional
- pairwise
- search algorithm
- optimal solution