\(d\)-transversals of stable sets and vertex covers in weighted bipartite graphs (Q2376794): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: The most vital nodes with respect to independent set and vertex cover / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Crown reductions for the minimum weighted vertex cover problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Minimum \(d\)-blockers and \(d\)-transversals in graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A combinatorial algorithm for weighted stable sets in bipartite graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Finding the \(k\) most vital edges with respect to minimum spanning trees for fixed \(k\) / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Blockers and transversals / rank | |||
Normal rank | |||
Latest revision as of 13:22, 6 July 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
0 references
