An algorithm for computing the universal Gröbner Basis of graph ideals.
Yannis C. StamatiouChristos TatakisPublished in: Int. J. Comput. Math. Comput. Syst. Theory (2019)
Keyphrases
- cost function
- k means
- neural network
- learning algorithm
- graph based algorithm
- computational cost
- tree structure
- detection algorithm
- optimization algorithm
- segmentation algorithm
- kolmogorov complexity
- maximum flow
- minimum spanning tree
- simulated annealing
- worst case
- np hard
- probabilistic model
- graph structure
- graph model
- edge weights
- search space
- optimal solution
- computer vision
- dominating set