Finding pattern matchings for permutations

Information Processing Letters

Volumn 61, Issue 6, 1997, Pages 293-295

  Ibarra, Louis ^a  

^a UNIVERSITY OF VICTORIA   (Canada)

Author keywords

Algorithms; Combinatorial problems

Indexed keywords

EID: 0004697313     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(97)00029-x     Document Type: Article

References (2)

1. P. Bose, J.F. Bluss and A. Lubiw, Pattern matching for permutations, in: Proc. Workshop on Algorithms and Data Structures, Lecture Notes in Computer Science, Vol. 709 (Springer, Berlin, 1993) 200-299.
2. D.G. Corneil, H. Lerchs and L.S. Burlingham, Complement-reducible graphs, Discrete Appl. Math. 3 (1981) 163-174.