Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity (Q1680547): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963603765 / rank
 
Normal rank

Revision as of 23:26, 19 March 2024

scientific article
Language Label Description Also known as
English
Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity
scientific article

    Statements

    Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    16 November 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    vertex cover
    0 references
    feedback vertex set
    0 references
    odd cycle transversal
    0 references
    price of connectivity
    0 references
    0 references