Permutations generated by token passing in graphs

Authors:
M. D. Atkinson;M. J. Livesey;D. Tulley
Affiliations:
School of Mathematical and Computational Sciences, St. Andrews, Scotland, UK;School of Mathematical and Computational Sciences, St. Andrews, Scotland, UK;School of Mathematical and Computational Sciences, St. Andrews, Scotland, UK
Venue:
Theoretical Computer Science
Year:
1997

Citing 0
Cited 4

Regular closed sets of permutations

Theoretical Computer Science
The Complexity of Sorting with Networks of Stacks and Queues

ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Sorting with networks of data structures

Discrete Applied Mathematics
An efficient programming model for memory-intensive recursive algorithms using parallel disks

Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation

Quantified Score

Hi-index	5.23

Visualization

Abstract