Pattern matching for permutations☆
References (17)
- et al.
Efficient algorithms for the maximum weight clique and maximum weight independent set problems on permutation graphs
Inform. Process. Lett.
(1992) - et al.
Complement-reducible graphs
Discrete Applied Math.
(1981) - et al.
Queues, stacks and graphs
Stack-sortable permutations
Discrete Math.
(1981)Generating trees and the Catalan and Schröder numbers
Discrete Math.
(1995)- et al.
A linear recognition algorithm for cographs
SIAM J. Comput.
(1985) - et al.
Computers and Intractability; A Guide to the Theory of NP-Completeness
(1979) Algorithmic Graph Theory and Perfect Graphs
(1980)
There are more references available in the full text version of this article.
Cited by (0)
- ☆
Work supported in part by NSERC. A preliminary version appeared in: F. Dehne, J.-R. Sack, N. Santoro, S. Whitesides (Eds.), Algorithms and Data Structures, Lecture Notes in Computer Science, vol. 709, Springer, Berlin, 1993, pp. 200–209.
Copyright © 1988 Published by Elsevier B.V.