Linear-time algorithms for maximum-weight induced matchings and minimum chain covers in convex bipartite graphs (Q2118390)

From MaRDI portal
Revision as of 05:56, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Linear-time algorithms for maximum-weight induced matchings and minimum chain covers in convex bipartite graphs
scientific article

    Statements

    Linear-time algorithms for maximum-weight induced matchings and minimum chain covers in convex bipartite graphs (English)
    0 references
    0 references
    0 references
    0 references
    22 March 2022
    0 references
    graph algorithm
    0 references
    induced matching
    0 references
    chain cover
    0 references
    convex bipartite graph
    0 references
    certifying algorithm
    0 references
    dynamic programming
    0 references

    Identifiers