An Efficient Primal Simplex Algorithm for Maximum Weighted Vertex Packing on Bipartite Graphs (Q3968760): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import240304020342 (talk | contribs)
Set profile property.
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:45, 5 March 2024

scientific article
Language Label Description Also known as
English
An Efficient Primal Simplex Algorithm for Maximum Weighted Vertex Packing on Bipartite Graphs
scientific article

    Statements

    An Efficient Primal Simplex Algorithm for Maximum Weighted Vertex Packing on Bipartite Graphs (English)
    0 references
    0 references
    0 references
    1982
    0 references
    primal algorithm
    0 references
    polynomial algorithm
    0 references
    maximal independent set
    0 references
    bipartite graph
    0 references
    NP-completeness
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references