Multiple hypernode hitting sets and smallest two-cores with targets (Q1041434): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1007/s10878-009-9234-9 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational aspects of monotone dualization: a brief survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Fixed-Parameter Tractable Classes of Hypergraph Duality and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms for Hitting Set: The Weighted Case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chordless paths through three vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10878-009-9234-9 / rank
 
Normal rank

Latest revision as of 14:33, 10 December 2024

scientific article
Language Label Description Also known as
English
Multiple hypernode hitting sets and smallest two-cores with targets
scientific article

    Statements

    Multiple hypernode hitting sets and smallest two-cores with targets (English)
    0 references
    0 references
    2 December 2009
    0 references
    hitting set
    0 references
    job assignment
    0 references
    parameterized algorithms
    0 references
    dynamic programming on subsets
    0 references
    cores in graphs
    0 references

    Identifiers