Decremental optimization of vertex-coloring under the reconfiguration framework (Q2695300): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-030-89543-3_30 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3209837998 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decremental Optimization of Dominating Sets Under the Reconfiguration Framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recoloring graphs via tree decompositions / 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: Using contracted solution graphs for solving reconfiguration problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectedness of the graph of vertex-colourings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding paths between 3-colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some perfect coloring properties of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Reconfigurations Analogue of Brooks' Theorem and Its Consequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of change / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of reconfiguration problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental optimization of independent sets under the reconfiguration framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding shortest paths between graph colourings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\beta\)-perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5133651 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to reconfiguration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Aspects of Vertex Elimination on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconfiguration in bounded bandwidth and tree-depth / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:45, 31 July 2024

scientific article
Language Label Description Also known as
English
Decremental optimization of vertex-coloring under the reconfiguration framework
scientific article

    Statements

    Decremental optimization of vertex-coloring under the reconfiguration framework (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    30 March 2023
    0 references

    Identifiers