Finding a complete matching with the maximum product on weighted bipartite graphs
From MaRDI portal
Publication:2365954
DOI10.1016/0898-1221(93)90199-6zbMath0771.05081OpenAlexW2117957311MaRDI QIDQ2365954
Frank S. C. Tseng, Wei-Pang Yang, Arbee L. P. Chen
Publication date: 29 June 1993
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0898-1221(93)90199-6
Applications of graph theory (05C90) Combinatorial optimization (90C27) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work