The Computational Complexity of Factored Graphs.
Shreya GuptaBoyang HuangRussell ImpagliazzoStanley WooChristopher YePublished in: CoRR (2024)
Keyphrases
- computational complexity
- np complete
- low complexity
- graph matching
- high computational complexity
- special case
- graph theory
- computationally efficient
- decision problems
- structured objects
- series parallel
- graph representation
- bipartite graph
- directed graph
- computational efficiency
- motion estimation
- graph structure
- graph model
- storage requirements
- state space
- computational cost
- np hard
- database