Reconfiguration of list \(L(2,1)\)-labelings in a graph (Q2250462): 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2014.04.011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1983081351 / 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: Finding paths between 3-colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time algorithm for \(L(2,1)\)-labeling of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3395518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximability of the subset sum reconfiguration problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of reconfiguration problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconfiguration of list edge-colorings in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconfiguration of List L(2,1)-Labelings in a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest paths between shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of independent set reconfigurability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: List version of \(L(d,s)\)-labelings / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the Boolean connectivity problem for \(k\)-CNF / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite Edge Coloring in $O(\Delta m)$ Time / rank
 
Normal rank

Latest revision as of 18:15, 8 July 2024

scientific article
Language Label Description Also known as
English
Reconfiguration of list \(L(2,1)\)-labelings in a graph
scientific article

    Statements

    Reconfiguration of list \(L(2,1)\)-labelings in a graph (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 July 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    graph algorithm
    0 references
    \(L(2,1)\)-labeling
    0 references
    PSPACE-completeness
    0 references
    reachability on solution space
    0 references
    0 references