\(d\)-transversals of stable sets and vertex covers in weighted bipartite graphs (Q2376794): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jda.2012.06.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4298220245 / rank
 
Normal rank

Revision as of 03:38, 20 March 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
    0 references
    0 references
    0 references
    0 references
    0 references
    24 June 2013
    0 references
    0 references
    0 references
    0 references
    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