\(d\)-transversals of stable sets and vertex covers in weighted bipartite graphs (Q2376794)
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 6180271
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | \(d\)-transversals of stable sets and vertex covers in weighted bipartite graphs |
scientific article; zbMATH DE number 6180271 |
Statements
\(d\)-transversals of stable sets and vertex covers in weighted bipartite graphs (English)
0 references
24 June 2013
0 references
minimum d-transversal
0 references
matching
0 references
maximum weight stable set
0 references
vertex cover
0 references
weighted bipartite graph
0 references
network flow
0 references
minimum weight vertex
0 references
minimum total cost
0 references
polynomial time algorithm
0 references
0 references
0.8813226
0 references
0 references
0.8742875
0 references
0.87084985
0 references
0.87007934
0 references
0.86938643
0 references
0.86914015
0 references
0.8679977
0 references
