Routing by matching on convex pieces of grid graphs

The routing number is a graph invariant introduced by Alon, Chung, and Graham in 1994, and it has been studied for trees and other classes of graphs such as hypercubes. It gives the minimum number of routing steps needed to sort a set of distinct tokens, placed one on each vertex, where each routing...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Computational geometry : theory and applications Jg. 104; S. 101862
Hauptverfasser:	Alpert, H., Barnes, R., Bell, S., Mauro, A., Nevo, N., Tucker, N., Yang, H.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 01.06.2022
Schlagworte:	Makespan Motion planning Parallel sorting Routing number Token graph Motion planning Makespan Token graph Parallel sorting Routing number
ISSN:	0925-7721
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!