Skip to main content Accessibility help
×
Home
Hostname: page-component-558cb97cc8-m5bhc Total loading time: 0.338 Render date: 2022-10-07T06:12:37.368Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "useRatesEcommerce": false, "displayNetworkTab": true, "displayNetworkMapGraph": true, "useSa": true } hasContentIssue true

On the permutational power of token passing networks

Published online by Cambridge University Press:  05 October 2010

Michael Albert
Affiliation:
Department of Computer Science University of Otago Dunedin New, Zealand
Steve Linton
Affiliation:
School of Computer Science University of St Andrews St Andrews, Fife, Scotland
Nik Ruškuc
Affiliation:
School of Mathematics and Statistics University of St Andrews St Andrews, Fife, Scotland
Steve Linton
Affiliation:
University of St Andrews, Scotland
Nik Ruškuc
Affiliation:
University of St Andrews, Scotland
Vincent Vatter
Affiliation:
Dartmouth College, New Hampshire
Get access
Type
Chapter
Information
Permutation Patterns , pp. 317 - 338
Publisher: Cambridge University Press
Print publication year: 2010

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1] M. H., Albert, M. D., Atkinson, and N., Ruškuc. Regular closed sets of permutations. Theoret. Comput. Sci., 306(1-3):85–100, 2003.Google Scholar
[2] M. D., Atkinson, M. J., Livesey, and D., Tulley. Permutations generated by token passing in graphs. Theoret. Comput. Sci., 178(1-2):103–118, 1997.Google Scholar
[3] V., Auletta, A., Monti, M., Parente, and P., Persiano. A linear-time algorithm for the feasibility of pebble motion on trees. Algorithmica, 23(3):223–245, 1999.Google Scholar
[4] V., Auletta and P., Persiano. Optimal pebble motion on a tree. Inform. and Comput., 165(1):42–68, 2001.Google Scholar
[5] D. E., Knuth. The art of computer programming. Vol. 1: Fundamental algorithms. Addison-Wesley Publishing Co., Reading, Mass., 1969.Google Scholar
[6] C. H., Papadimitriou, P., Raghavan, M., Sudan, and H., Tamaki. Motion planning on a graph (extended abstract). In S., Goldwasser, editor, 35th Annual Symposium on Foundations of Computer Science, pages 511–520. IEEE, 1994.Google Scholar
[7] V. R., Pratt. Computing permutations with double-ended queues, parallel stacks and parallel queues. In STOC '73: Proceedings of the fifth annual ACM symposium on Theory of computing, pages 268–277, New York, NY, USA, 1973. ACM Press.Google Scholar
[8] D., Ratner and M., Warmuth. The (n2 – 1)-puzzle and related relocation problems. J. Symbolic Comput., 10(2):111–137, 1990.Google Scholar
[9] R., Tarjan. Sorting using networks of queues and stacks. J. Assoc. Comput. Mach., 19:341–346, 1972.Google Scholar
[10] R. M., Wilson. Graph puzzles, homotopy, and the alternating group. J. Combinatorial Theory Ser. B, 16:86–96, 1974.Google Scholar

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×