A Self-Stabilizing Algorithm for Constructing a Maximal (2, 2)-Directed Acyclic Mixed Graph.
Yonghwan KimHiroki AonoYoshiaki KatayamaToshimitsu MasuzawaPublished in: CANDAR (2018)
Keyphrases
- directed acyclic
- graph structure
- detection algorithm
- learning algorithm
- preprocessing
- dynamic programming
- computational complexity
- k means
- np hard
- graph based algorithm
- optimal solution
- matching algorithm
- state space
- graphical models
- simulated annealing
- worst case
- databases
- objective function
- bayesian networks
- data points
- segmentation algorithm
- cost function
- high dimensional
- connected components
- directed acyclic graph
- spanning tree
- undirected graph
- polynomial time complexity
- information retrieval