Reconfigurations in Graphs and Grids

Let G be a connected graph, and let V and V ′ two n-element subsets of its vertex set V(G). Imagine that we place a chip at each element of V and we want to move them into the positions of V ′ (V and V ′ may have common elements). A move is defined as shifting a chip from v1 to v2 (v1,v2 ∈ V(G)) on...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Calinescu, Gruia, Dumitrescu, Adrian, Pach, János
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Applied sciences Computer science control theory systems Exact sciences and technology Feasible Solution Free Vertex Intermediate Vertex Local Ratio Recursive Call Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!