Parameterized complexity of the list coloring reconfiguration problem with graph parameters (Q1643161): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2018.05.005 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963170745 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Bounded Length Graph Recoloring and CSP Reconfiguration / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dichotomy theorem for circular colouring reconfiguration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Paths Between Graph Colourings: PSPACE-Completeness and Superpolynomial Distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding paths between 3-colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomly coloring sparse random graphs with fewer colors than the maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms for Modular-Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transitiv orientierbare Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of the algorithmic aspects of modular decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The coloring reconfiguration problem on specific graph classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of reconfiguration problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding shortest paths between graph colourings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implicat Representation of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time modular decomposition of directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of change / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphism reconfiguration via homotopy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconfiguration in bounded bandwidth and tree-depth / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129860106 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2018.05.005 / rank
 
Normal rank

Latest revision as of 00:30, 11 December 2024

scientific article
Language Label Description Also known as
English
Parameterized complexity of the list coloring reconfiguration problem with graph parameters
scientific article

    Statements

    Parameterized complexity of the list coloring reconfiguration problem with graph parameters (English)
    0 references
    0 references
    0 references
    0 references
    18 June 2018
    0 references
    combinatorial reconfiguration
    0 references
    graph algorithm
    0 references
    list coloring
    0 references
    fixed-parameter algorithm
    0 references
    W[1]-hardness
    0 references

    Identifiers

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