Multiple Hypernode Hitting Sets and Smallest Two-Cores with Targets (Q5505641): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The steiner problem in graphs / 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: Graph-Theoretic Concepts in Computer Science / 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

Latest revision as of 23:53, 28 June 2024

scientific article; zbMATH DE number 5498441
Language Label Description Also known as
English
Multiple Hypernode Hitting Sets and Smallest Two-Cores with Targets
scientific article; zbMATH DE number 5498441

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references