Permutations generated by token passing in graphs

DOI10.1016/S0304-3975(96)00057-6zbMath0901.68143OpenAlexW2103793661MaRDI QIDQ1391529

D. Massart

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

zbMATH Keywords

directed graphpacket-switching network

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items

Sorting by shuffling methods and a queue ⋮ Sorting with networks of data structures ⋮ Bounded capacity priority queues ⋮ Regular closed sets of permutations. ⋮ Permutations generated by stacks and deques ⋮ Inglenook shunting puzzles ⋮ 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