A Sparsification Based Algorithm for Maximum-Cardinality Bipartite Matching in Planar Graphs
Matching is one of the most fundamental algorithmic graph problems. Many variants of matching problems have been studied on different classes of graphs, the one of special interest to us being the Maximum Cardinality Bipartite Matching in Planar Graphs. In this work, we present a novel sparsifica...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Published: |
Virginia Tech
2019
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10919/88080 |