A Polynomial-Time Algorithm for MCS Partial Search Order on Chordal Graphs.
Guozhen RongYongjie YangWenjun LiPublished in: MFCS (2023)
Keyphrases
- search space
- dynamic programming
- detection algorithm
- k means
- graph isomorphism
- learning algorithm
- expectation maximization
- np hard
- search algorithm
- adjacency graph
- segmentation algorithm
- search efficiency
- search strategy
- exhaustive search
- search mechanism
- depth first search
- strongly polynomial
- approximation algorithms
- solution space
- matching algorithm
- particle swarm optimization
- preprocessing
- computational complexity
- weighted graph
- undirected graph
- special case
- pruning the search space
- genetic algorithm