Maximum bounded 3-dimensional matching is MAX SNP-complete (Q922700): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import recommendations run Q6767936
 
(One intermediate revision by one other user not shown)
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/ipl/Kann91 / rank
 
Normal rank
Property / Recommended article
 
Property / Recommended article: Maximum bounded \(H\)-matching is Max SNP-complete / rank
 
Normal rank
Property / Recommended article: Maximum bounded \(H\)-matching is Max SNP-complete / qualifier
 
Similarity Score: 0.9182398
Amount0.9182398
Unit1
Property / Recommended article: Maximum bounded \(H\)-matching is Max SNP-complete / qualifier
 
Property / Recommended article
 
Property / Recommended article: Three-dimensional matching instances are rich in stable matchings / rank
 
Normal rank
Property / Recommended article: Three-dimensional matching instances are rich in stable matchings / qualifier
 
Similarity Score: 0.8146555
Amount0.8146555
Unit1
Property / Recommended article: Three-dimensional matching instances are rich in stable matchings / qualifier
 
Property / Recommended article
 
Property / Recommended article: Tight bounds on maximal and maximum matchings / rank
 
Normal rank
Property / Recommended article: Tight bounds on maximal and maximum matchings / qualifier
 
Similarity Score: 0.8110938
Amount0.8110938
Unit1
Property / Recommended article: Tight bounds on maximal and maximum matchings / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q4474098 / rank
 
Normal rank
Property / Recommended article: Q4474098 / qualifier
 
Similarity Score: 0.8110938
Amount0.8110938
Unit1
Property / Recommended article: Q4474098 / qualifier
 
Property / Recommended article
 
Property / Recommended article: Tighter bounds on the size of a maximum \(P_{3}\)-matching in a cubic graph / rank
 
Normal rank
Property / Recommended article: Tighter bounds on the size of a maximum \(P_{3}\)-matching in a cubic graph / qualifier
 
Similarity Score: 0.8089033
Amount0.8089033
Unit1
Property / Recommended article: Tighter bounds on the size of a maximum \(P_{3}\)-matching in a cubic graph / qualifier
 
Property / Recommended article
 
Property / Recommended article: Three-Dimensional Stabl Matching Problems / rank
 
Normal rank
Property / Recommended article: Three-Dimensional Stabl Matching Problems / qualifier
 
Similarity Score: 0.8052131
Amount0.8052131
Unit1
Property / Recommended article: Three-Dimensional Stabl Matching Problems / qualifier
 
Property / Recommended article
 
Property / Recommended article: Bounds on maximum \(b\)-matchings / rank
 
Normal rank
Property / Recommended article: Bounds on maximum \(b\)-matchings / qualifier
 
Similarity Score: 0.8004068
Amount0.8004068
Unit1
Property / Recommended article: Bounds on maximum \(b\)-matchings / qualifier
 
Property / Recommended article
 
Property / Recommended article: Parameterizing MAX SNP Problems Above Guaranteed Values / rank
 
Normal rank
Property / Recommended article: Parameterizing MAX SNP Problems Above Guaranteed Values / qualifier
 
Similarity Score: 0.796345
Amount0.796345
Unit1
Property / Recommended article: Parameterizing MAX SNP Problems Above Guaranteed Values / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q4729838 / rank
 
Normal rank
Property / Recommended article: Q4729838 / qualifier
 
Similarity Score: 0.7962979
Amount0.7962979
Unit1
Property / Recommended article: Q4729838 / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q4953913 / rank
 
Normal rank
Property / Recommended article: Q4953913 / qualifier
 
Similarity Score: 0.7933055
Amount0.7933055
Unit1
Property / Recommended article: Q4953913 / qualifier
 

Latest revision as of 11:50, 4 April 2025

scientific article
Language Label Description Also known as
English
Maximum bounded 3-dimensional matching is MAX SNP-complete
scientific article

    Statements

    Maximum bounded 3-dimensional matching is MAX SNP-complete (English)
    0 references
    0 references
    1991
    0 references
    approximation
    0 references
    combinatorial problems
    0 references
    computational complexity
    0 references
    MAX SNP- complete problems
    0 references

    Identifiers