A Polynomial-Time Algorithm for MCS Partial Search Order on Chordal Graphs.
Guozhen RongYongjie YangWenjun LiPublished in: CoRR (2022)
Keyphrases
- dynamic programming
- learning algorithm
- search space
- worst case
- search strategy
- computational complexity
- k means
- preprocessing
- search algorithm
- polynomial time complexity
- segmentation algorithm
- matching algorithm
- strongly polynomial
- random graphs
- graph structure
- detection algorithm
- undirected graph
- search efficiency
- objective function
- optimal solution
- np hard
- genetic algorithm
- approximation algorithms
- weighted graph
- search procedure
- minimum spanning tree
- graph search
- search mechanism
- graph isomorphism
- partial plans