On computational complexity of graph inference from counting.
Szilárd Zsolt FazekasHiro ItoYasushi OkunoShinnosuke SekiKei TaneishiPublished in: Nat. Comput. (2013)
Keyphrases
- computational complexity
- special case
- clique tree
- directed graph
- probabilistic inference
- random walk
- np complete
- bayesian networks
- inference process
- connected components
- graph partitioning
- graph representation
- graph structure
- graph theory
- graph mining
- graph model
- memory requirements
- low complexity
- inference engine
- decision problems
- computational efficiency
- graphical structure
- computational cost
- probabilistic reasoning
- random graphs
- graph theoretic
- bayesian inference
- graph structures
- stable set
- storage requirements
- directed acyclic graph
- link analysis
- belief networks
- graph matching
- relational data
- information extraction
- rate distortion
- structured data
- computationally efficient