A Self-Stabilizing Algorithm for Constructing a Maximal (1, 1)-Directed Acyclic Mixed Graph.
Yonghwan KimHaruka OhnoYoshiaki KatayamaToshimitsu MasuzawaPublished in: Int. J. Netw. Comput. (2018)
Keyphrases
- directed acyclic
- graph structure
- learning algorithm
- np hard
- search space
- dynamic programming
- graph based algorithm
- computational complexity
- preprocessing
- matching algorithm
- tree structure
- minimum spanning tree
- weighted graph
- information retrieval
- cost function
- high dimensional
- dominating set
- maximum flow
- markov random field
- suffix tree
- detection algorithm
- optimal solution
- objective function
- genetic algorithm