Chang Maw-Shang

Maw-Shang Chang

Information about the author Maw-Shang Chang will soon be added to the site.
Found 1 papers in total
Moderately exponential time algorithms for the maximum induced matching problem
2015
An induced matching M ⊆ E in a graph G = ( V , E ) is a matching such that no two...
Papers per page: