JOURNAL ARTICLE

An NP-complete matching problem

David A. PlaistedSamuel Zaks

Year: 1980 Journal:   Discrete Applied Mathematics Vol: 2 (1)Pages: 65-72   Publisher: Elsevier BV
Keywords:
Mathematics NP-complete Combinatorics Matching (statistics) Discrete mathematics Time complexity Statistics

Metrics

10
Cited By
0.00
FWCI (Field Weighted Citation Impact)
9
Refs
0.23
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Advanced Graph Theory Research
Physical Sciences →  Computer Science →  Computational Theory and Mathematics
Optimization and Search Problems
Physical Sciences →  Computer Science →  Computer Networks and Communications
Complexity and Algorithms in Graphs
Physical Sciences →  Computer Science →  Computational Theory and Mathematics

Related Documents

JOURNAL ARTICLE

NP-complete stable matching problems

Eytan Ronn

Journal:   Journal of Algorithms Year: 1990 Vol: 11 (2)Pages: 285-304
JOURNAL ARTICLE

Certain NP-complete matching problems

G. Loizou

Journal:   Information Sciences Year: 1984 Vol: 32 (2)Pages: 117-121
JOURNAL ARTICLE

The matching extension problem in general graphs is co-NP-complete

Jan HackfeldArie M. C. A. Koster

Journal:   Journal of Combinatorial Optimization Year: 2017 Vol: 35 (3)Pages: 853-859
JOURNAL ARTICLE

Elastic image matching is NP-complete

Daniel KeysersWalter Unger

Journal:   Pattern Recognition Letters Year: 2002 Vol: 24 (1-3)Pages: 445-453
BOOK-CHAPTER

Linear Higher-Order Matching Is NP-Complete

Philippe de Groote

Lecture notes in computer science Year: 2000 Pages: 127-140
© 2026 ScienceGate Book Chapters — All rights reserved.