The matching extension problem in general graphs is co-NP-complete
Work
Year: 2017
Type: article
Authors Jan Hackfeld, Arie M. C. A. Koster
Institutions Humboldt-Universität zu Berlin, RWTH Aachen University
Cites: 8
Cited by: 7
Related to: 10
FWCI: 0.192
Citation percentile (by year/subfield): 57.56
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: closed