Forbidden Subsequences and Permutations Sortable on Two Parallel Stacks

Tero Harju and Lucian Ilie ()
Additional contact information
Tero Harju: University of Turku, Mathematics Department
Lucian Ilie: Turku Centre for Computer Science (TUCS)

Chapter Chapter 24 in Where Mathematics, Computer Science, Linguistics and Biology Meet, 2001, pp 267-275 from Springer

Abstract: Abstract We give a new combinatorial proof, based on stack graphs, for the characterization by forbidden subsequences of the permutations which are sortable on two parallel stacks. Some remarks about the permutations sortable on parallel queues are also made.

Keywords: Chromatic Number; Intersection Graph; Circle Graph; Combinatorial Proof; Parallel Queue (search for similar items in EconPapers)
Date: 2001
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-94-015-9634-3_24

Ordering information: This item can be ordered from
http://www.springer.com/9789401596343

DOI: 10.1007/978-94-015-9634-3_24

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().