Parameterized Complexity of Graph Burning (Q6089668): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
label / enlabel / en
 
Parameterized Complexity of Graph Burning
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.4230/LIPIcs.IPEC.2020.21 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3117515187 / rank
 
Normal rank
Property / title
 
Parameterized Complexity of Graph Burning (English)
Property / title: Parameterized Complexity of Graph Burning (English) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Burning a graph is hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the burning number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernel bounds for disjoint cycles and disjoint paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Burning the plane. Densities of the infinite Cartesian grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Burning a Graph as a Model of Social Contagion / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Burn a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for graph burning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the burning numbers of spiders and path-forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Relationship Between Clique-Width and Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time solvable optimization problems on graphs of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Burning spiders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization Lower Bounds Through Colors and IDs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-Parameter Tractability and Completeness I: Basic Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4193514 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms for Modular-Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding First-Order Properties of Nowhere Dense Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The behavior of clique-width under graph operations and graph transformations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Burning Number of Directed Graphs: Bounds and Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Burning Two Worlds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized algorithms for Graph Burning problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound on the burning number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Burning number of caterpillars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Burning numbers of path forests and spiders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Burning number of theta graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Burning graphs: a probabilistic perspective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Burning number of graph products / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparsity. Graphs, structures, and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating rank-width and clique-width quickly / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph burning: tight bounds on the burning numbers of path forests and spiders / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:59, 3 August 2024

scientific article; zbMATH DE number 7764112
Language Label Description Also known as
English
Parameterized Complexity of Graph Burning
scientific article; zbMATH DE number 7764112

    Statements

    0 references
    0 references
    13 November 2023
    0 references
    graph burning
    0 references
    parameterized complexity
    0 references
    fixed-parameter tractability
    0 references
    Parameterized Complexity of Graph Burning (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references