The complexity of matching with bonds
type: Item
instance of: scholarly article
title: The complexity of matching with bonds
zbMATH Open document ID: 0677.68053
DOI: 10.1016/0020-0190(89)90021-5
author: Antonio Sassano
author: Manfred Padberg
published in: Information Processing Letters
publication date: 1989-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 03D15
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 4110117
zbMATH Keywords: computational complexity
zbMATH Keywords: restricted matching problems
zbMATH Keywords: Matching with bonds
zbMATH Keywords: maximum-weight matching
zbMATH Keywords: NP-hard problem
MaRDI profile type: Publication
full work available at URL: 0020-0190(89)90021-5
OpenAlex ID: W2094880781
cites work: Q4099676
cites work: Matching, Euler tours and the Chinese postman
cites work: Some simplified NP-complete graph problems
cites work: Some Matching Problems for Bipartite Graphs
cites work: Q3048571
cites work: The complexity of restricted spanning tree problems
description: scientific article; zbMATH DE number 4110117