Push-relabel based algorithms for the maximum transversal problem (Q502434)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6670616
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Push-relabel based algorithms for the maximum transversal problem |
scientific article; zbMATH DE number 6670616 |
Statements
Push-relabel based algorithms for the maximum transversal problem (English)
0 references
5 January 2017
0 references
bipartite graphs
0 references
matching
0 references
push-relabel-based algorithms
0 references
graph theory
0 references
0.8404809832572937
0 references
0.8140891790390015
0 references
0.8106614351272583
0 references
0.8058788776397705
0 references
0.7999413013458252
0 references
