A linear algorithm for a perfect matching in polyomino graphs.
Yuqing LinFuji ZhangPublished in: Theor. Comput. Sci. (2017)
Keyphrases
- matching algorithm
- computational cost
- k means
- search space
- cost function
- graph structure
- linear programming
- worst case
- probabilistic model
- preprocessing
- computational complexity
- optimal solution
- linear complexity
- segmentation algorithm
- string matching
- graph matching
- closed form
- image matching
- optimization algorithm
- dynamic programming
- detection algorithm
- learning algorithm
- convex hull
- image registration
- weighted graph
- matching process
- linear systems
- np hard
- graph construction
- social networks