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...

Full description

Saved in:

Bibliographic Details
Published in:	Computational geometry : theory and applications Vol. 104; p. 101862
Main Authors:	Alpert, H., Barnes, R., Bell, S., Mauro, A., Nevo, N., Tucker, N., Yang, H.
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.06.2022
Subjects:	Makespan Motion planning Parallel sorting Routing number Token graph Motion planning Makespan Token graph Parallel sorting Routing number
ISSN:	0925-7721
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!