A self-stabilizing algorithm for constructing a maximal (σ, τ)-directed acyclic mixed graph.
Yonghwan KimYoshiaki KatayamaToshimitsu MasuzawaPublished in: Concurr. Comput. Pract. Exp. (2021)
Keyphrases
- directed acyclic
- graph structure
- objective function
- computational complexity
- np hard
- preprocessing
- search space
- k means
- expectation maximization
- learning algorithm
- graph based algorithm
- matching algorithm
- data structure
- cost function
- worst case
- graph search
- minimum spanning tree
- tree structure
- segmentation algorithm
- detection algorithm
- itemsets
- particle swarm optimization
- graph matching
- optimal solution
- simulated annealing
- probabilistic model
- maximum flow
- search engine
- information retrieval