Perfect matching and polymatroids
type: Item
instance of: scholarly article
title: Perfect matching and polymatroids
zbMATH Open document ID: 1379.05092
author: F. A. Sharifov
published in: Cybernetics and Systems Analysis
publication date: 2018-02-13T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05B35
Mathematics Subject Classification ID: 52B40
zbMATH DE Number: 6837546
zbMATH Keywords: perfect matching
zbMATH Keywords: extended polymatroid
MaRDI profile type: Publication
full work available at URL: s10559-017-9977-8
OpenAlex ID: W2758082438
cites work: Q3395507
cites work: Geometric algorithms and combinatorial optimization
cites work: Perfect matchings and extended polymatroid
cites work: Perfectly matchable subgraph problem on a bipartite graph
cites work: Estimating the supply chain efficiency loss when the seller has to estimate the buyer's willingness to pay
DOI: 10.1007/S10559-017-9977-8
Recommended article: Perfect matchings and extended polymatroid
Recommended article: Perfect matchings of polyomino graphs
Recommended article: Perfect matchings of generalized polyomino graphs
Recommended article: Q3579355
Recommended article: On perfect \(k\)-matchings
Recommended article: Perfect matchings and derangements on graphs
Recommended article: Perfect Matchings in Hypergraphs and the Erdös Matching Conjecture
Recommended article: On Perfect Matchings in k-Complexes
Recommended article: Perfect matchings and perfect powers
Recommended article: The graph of perfect matching polytope and an extreme problem
description: scientific article; zbMATH DE number 6837546