An NP-complete matching problem

DOI10.1016/0166-218X(80)90055-4zbMath0489.68064OpenAlexW2061934263WikidataQ106200605 ScholiaQ106200605MaRDI QIDQ1166935

David Alan Plaisted, Shmuel Zaks

Publication date: 1980

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(80)90055-4

zbMATH Keywords

polynomial time algorithmdegrees of the verticespartitions of the vertices of the graphrestricted form of the perfect matching problem for bipartite graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (4)

Acyclicity in edge-colored graphs ⋮ Decomposition of university course timetabling. A systematic study of subproblems and their complexities ⋮ On complexity of special maximum matchings constructing ⋮ An algebraic Monte-Carlo algorithm for the partition adjacency matrix realization problem

Cites Work

• Unnamed Item
• Unnamed Item
• Some Matching Problems for Bipartite Graphs
• The complexity of satisfiability problems
• The complexity of theorem-proving procedures

This page was built for publication: An NP-complete matching problem