Indexed metadata

Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem

Abraham P. Punnen, K.P.K. Nair

Source record

Source: Crossref

Published: Oct 1, 1994

DOI: 10.1016/0166-218x(94)90039-6

Open original source ↗

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.

Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem — Mathematical Frontier Network