The complexity of matching with bonds
From MaRDI portal
Publication:1123620
DOI10.1016/0020-0190(89)90021-5zbMath0677.68053MaRDI QIDQ1123620
Antonio Sassano, Manfred W. Padberg
Publication date: 1989
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(89)90021-5
computational complexity; NP-hard problem; maximum-weight matching; restricted matching problems; Matching with bonds
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
03D15: Complexity of computation (including implicit computational complexity)
Related Items
Cites Work