Parameterized Complexity of Firefighting Revisited (Q2891334): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Easy problems for tree-decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Complexity of the Firefighter Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: On problems without polynomial kernels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3113681 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Firefighting on Trees: (1 − 1/e)–Approximation, Fixed Parameter Tractability and a Subexponential Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameter and treewidth in minor-closed graph families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4504908 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The firefighter problem for graphs of maximum degree three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3614015 / rank
 
Normal rank
Property / cites work
 
Property / cites work: TOWARDS MORE EFFICIENT INFECTION AND FIRE FIGHTING / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549693 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4457546 / rank
 
Normal rank

Latest revision as of 08:02, 5 July 2024

scientific article
Language Label Description Also known as
English
Parameterized Complexity of Firefighting Revisited
scientific article

    Statements

    Identifiers

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