Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem (Q1337676): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Computing a maximum cardinality matching in a bipartite graph in time \(O(n^{1,5}\sqrt{m/\log \,n})\) / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Solving linear bottleneck assignment problems via strong spanning trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An augmenting path method for solving linear bottleneck assignment problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Algorithms for two bottleneck optimization problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3707420 / rank | |||
Normal rank | |||
Latest revision as of 09:21, 23 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem |
scientific article |
Statements
Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem (English)
0 references
8 November 1994
0 references
bipartite graph
0 references
bottleneck bipartite matching problem
0 references
maximum cardinality matching
0 references
worst-case complexity
0 references
0 references
