A combinatorial algorithm for weighted stable sets in bipartite graphs (Q2492214): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence numbers of graphs - an extension of the Koenig-Egervary theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network Flow and Testing Graph Connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new?old algorithm for minimum-cut and maximum-flow in closure graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4058442 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank

Latest revision as of 16:37, 24 June 2024

scientific article
Language Label Description Also known as
English
A combinatorial algorithm for weighted stable sets in bipartite graphs
scientific article

    Statements

    A combinatorial algorithm for weighted stable sets in bipartite graphs (English)
    0 references
    0 references
    0 references
    9 June 2006
    0 references
    0 references
    stable set
    0 references
    bipartite graph
    0 references
    tree solution
    0 references
    0 references