An NP-complete matching problem (Q1166935): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: David Alan Plaisted / rank | |||
Property / author | |||
Property / author: Shmuel Zaks / rank | |||
Property / author | |||
Property / author: David Alan Plaisted / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Shmuel Zaks / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q106200605 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The complexity of theorem-proving procedures / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some Matching Problems for Bipartite Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4142699 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3048571 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The complexity of satisfiability problems / rank | |||
Normal rank |
Revision as of 16:22, 13 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An NP-complete matching problem |
scientific article |
Statements
An NP-complete matching problem (English)
0 references
1980
0 references
restricted form of the perfect matching problem for bipartite graphs
0 references
partitions of the vertices of the graph
0 references
degrees of the vertices
0 references
polynomial time algorithm
0 references