Perfect matchings and extended polymatroid
type: Item
instance of: scholarly article
title: Perfect matchings and extended polymatroid
zbMATH Open document ID: 1144.05053
author: F. A. Sharifov
published in: Cybernetics and Systems Analysis
publication date: 2008-09-24T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05B35
zbMATH DE Number: 5346524
zbMATH Keywords: perfect matching
zbMATH Keywords: bipartite graph
zbMATH Keywords: extended polymatroid
MaRDI profile type: Publication
full work available at URL: s10559-008-9013-0
OpenAlex ID: W2015524385
cites work: Computing a maximum cardinality matching in a bipartite graph in time \(O(n^{1,5}\sqrt{m/\log \,n})\)
cites work: Selected topics on assignment problems
cites work: Signature Methods for the Assignment Problem
cites work: Minimum cut problem using bases of extended polymatroids
DOI: 10.1007/S10559-008-9013-0
description: scientific article; zbMATH DE number 5346524