Parameterized complexity of graph burning (Q2161013): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W3042241622 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transmitting in the \(n\)-dimensional cube / 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: A survey of graph burning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounds for burning fence graphs / 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: On Well-Partial-Order Theory and Its Application to Combinatorial Problems of VLSI Design / 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: Q4198056 / 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: On the burning number of \(p\)-caterpillars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4887744 / 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: On transmitting delay in a distance-transitive strongly antipodal graph / 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: Spanning Trees with Many Leaves / 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: Routing and transmitting problems in de Bruijn networks / 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: APX-hardness and approximation for the \(k\)-burning number problem / 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

Latest revision as of 20:17, 29 July 2024

scientific article
Language Label Description Also known as
English
Parameterized complexity of graph burning
scientific article

    Statements

    Parameterized complexity of graph burning (English)
    0 references
    0 references
    0 references
    0 references
    3 August 2022
    0 references
    0 references
    graph burning
    0 references
    parameterized complexity
    0 references
    fixed-parameter tractability
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references