|
|||||
|
|
NP-completeness of some generalizations of the maximum matching problem |
|
| Authors: | Larry J Stockmeyer Vijay V Vazirani |
| Affiliation: | Mathematical Sciences Department, IBM Thomas J. Watson Research Center, Yorktown Heights, NY 10598, U.S.A.;Computer Science Division, University of California at Berkeley, Berkeley, CA 94720, U.S.A |
| Abstract: | |
| Keywords: | Computational complexity NP-completeness matching problem communication network testing |
| 本文献已被 ScienceDirect 等数据库收录！ | |