A Faster Algorithm for Minimum-Cost Bipartite Perfect Matching in Planar Graphs.
Mudabir Kabir AsathullaSanjeev KhannaNathaniel LahnSharath RaghvendraPublished in: SODA (2018)
Keyphrases
- minimum cost
- np hard
- matching algorithm
- undirected graph
- spanning tree
- image matching
- computational complexity
- network flow
- graph model
- combinatorial optimization
- expectation maximization
- dynamic programming
- worst case
- optimal solution
- network flow problem
- energy function
- minimum spanning tree
- minimal cost
- planar graphs