A note on the parity assignment problem (Q5423148): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Perspectives of Monge properties in optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selected topics on assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Max algebra and the linear assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularity of matrices in min-algebra and its time-complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Max-algebra: The linear algebra of combinatorics? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal (max,+) Realization of Convex Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4217266 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permanents, Pfaffian orientations, and even directed circuits / rank
 
Normal rank

Latest revision as of 11:32, 27 June 2024

scientific article; zbMATH DE number 5203359
Language Label Description Also known as
English
A note on the parity assignment problem
scientific article; zbMATH DE number 5203359

    Statements