Token reconfiguration
id:
token-reconfiguration-241-8062514
title:
Token reconfiguration
text:
In computational complexity theory and combinatorics, the token reconfiguration problem is a reconfiguration problem on a graph with both an initial and desired state for tokens. Given a graph G , an initial state of tokens is defined by a subset V ⊂ V of the vertices of the graph; let n = | V | . Moving a token from vertex v 1 to vertex v 2 is valid if v 1 and v 2 are joined by a path in G that does not contain any other tokens; note that the distance traveled within the graph is inconsequentia
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Token_reconfiguration
date created:
date modified:
2023-08-23T11:37:28Z
main entity:
{"identifier":"Q25303754","url":"https://www.wikidata.org/entity/Q25303754"}
image:
fields total:
13
integrity:
13