\(d\)-transversals of stable sets and vertex covers in weighted bipartite graphs (Q2376794): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 19:28, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | \(d\)-transversals of stable sets and vertex covers in weighted bipartite graphs |
scientific article |
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
