3 ms·
It surprised me that matching is not NP-complete.
by jules 16y ago
It surprised me that matching is not NP-complete.
- mikleb 16y agoBut maximal matroid matching is NP-hard. ;) Approximating the minimum spaning tree weight in subliner time is very unexpected algorithm.