Nucleus Decomposition in Probabilistic Graphs: Hardness and Algorithms.
Fatemeh EsfahaniVenkatesh SrinivasanAlex ThomoKui WuPublished in: CoRR (2020)
Keyphrases
- computational complexity
- computationally efficient
- orders of magnitude
- data structure
- significant improvement
- computational cost
- decomposition algorithm
- polynomial time complexity
- learning algorithm
- np complete
- probabilistic model
- optimization problems
- constraint satisfaction problems
- worst case
- constraint satisfaction
- directed graph
- learning theory
- graph theory
- decomposition methods
- representational power
- objective function