Permutations generated by token passing in graphs
From MaRDI portal
Publication:1391529
DOI10.1016/S0304-3975(96)00057-6zbMath0901.68143MaRDI QIDQ1391529
Publication date: 22 July 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(96)00057-6
68R10: Graph theory (including graph drawing) in computer science
Related Items
Sorting with networks of data structures, Permutations generated by stacks and deques, Bounded capacity priority queues, Regular closed sets of permutations., Inglenook shunting puzzles, Sorting by shuffling methods and a queue, Permutations generated by a depth 2 stack and an infinite stack in series are algebraic
Cites Work
- On a correspondence between binary trees and a certain type of permutation
- An End-to-End Approach to the Resequencing Problem
- Queueing Analysis of a Reordering Issue
- Sorting Using Networks of Queues and Stacks
- Restricted permutations
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item