Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms (Q1877711)

From MaRDI portal
Revision as of 03:22, 16 February 2024 by RedirectionBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms
scientific article

    Statements

    Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms (English)
    0 references
    19 August 2004
    0 references
    0 references
    0 references
    0 references
    0 references
    Vertex cover
    0 references
    Bipartite graph
    0 references
    Graph matching
    0 references
    Parameterized computation
    0 references
    0 references
    0 references