An Optimal Algorithm for Enumerating Connected Convex Subgraphs in Acyclic Digraphs.
Chenglong XiaoShanshan WangWanjun LiuXinlin WangEmmanuel CasseauPublished in: IEEE Trans. Circuits Syst. II Express Briefs (2021)
Keyphrases
- dynamic programming
- worst case
- optimal solution
- computational cost
- learning algorithm
- detection algorithm
- piecewise linear
- cost function
- np hard
- exhaustive search
- conflict free
- k means
- globally optimal
- similarity measure
- convergence rate
- convex hull
- optimization algorithm
- expectation maximization
- significant improvement
- search space
- computational complexity
- segmentation algorithm
- np complete
- linear programming
- functional dependencies
- probabilistic model
- undirected graph
- relational databases
- optimal parameters