SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Information Processing Letters

Volumn 65, Issue 5, 1998, Pages 277-283

Pattern matching for permutations

(3) Bose, Prosenjit a Buss, Jonathan F b Lubiw, Anna b

a MCGILL UNIVERSITY (Canada)

b UNIVERSITY OF WATERLOO (Canada)

Author keywords

Algorithms; Computational complexity; Pattern matching; Permutation; Separable permutation

Indexed keywords

EID: 0001753738 PISSN: 00200190 EISSN: None Source Type: Journal
DOI: 10.1016/s0020-0190(97)00209-3 Document Type: Article

Times cited : (194)

References (17)

1
- 0026929475
- Efficient algorithms for the maximum weight clique and maximum weight independent set problems on permutation graphs
- M.-S. Chang, F.-H. Wang, Efficient algorithms for the maximum weight clique and maximum weight independent set problems on permutation graphs, Inform. Process. Lett. 43 (1992) 293-295.
- (1992) Inform. Process. Lett. , vol.43 , pp. 293-295
- Chang, M.-S.¹ Wang, F.-H.²

2
- 0019590904
- Complement-reducible graphs
- D.G. Cornell, H. Lerchs, L. Stewart Burlingham, Complement-reducible graphs, Discrete Applied Math. 3 (1981) 163-174.
- (1981) Discrete Applied Math. , vol.3 , pp. 163-174
- Cornell, D.G.¹ Lerchs, H.² Burlingham, L.S.³

3
- 0022162058
- A linear recognition algorithm for cographs
- D.G. Corneil, Y. Perl, L.K. Stewart, A linear recognition algorithm for cographs, SIAM J. Comput. 14 (1985) 926-934.
- (1985) SIAM J. Comput. , vol.14 , pp. 926-934
- Corneil, D.G.¹ Perl, Y.² Stewart, L.K.³

4
- 0002959711
- Queues, stacks and graphs
- Z. Kohavi, A. Paz (Eds.), Academic Press, New York
- S. Even, A. Itai, Queues, stacks and graphs, in: Z. Kohavi, A. Paz (Eds.), Theory of Machines and Computations, Academic Press, New York, 1971, pp. 71-86.
- (1971) Theory of Machines and Computations , pp. 71-86
- Even, S.¹ Itai, A.²

5
- 0003603813
- Freeman, San Francisco
- M.R. Garey, D.S. Johnson, Computers and Intractability; A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.
- (1979) Computers and Intractability; A Guide to the Theory of NP-completeness
- Garey, M.R.¹ Johnson, D.S.²

6
- 0003947606
- Academic Press, New York
- M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
- (1980) Algorithmic Graph Theory and Perfect Graphs
- Golumbic, M.C.¹

7
- 0041302077
- Tech. Rept., Rutgers, NJ
- L. Ibarra, Finding pattern matchings for permutations. Tech. Rept., Rutgers, NJ, 1995.
- (1995) Finding Pattern Matchings for Permutations
- Ibarra, L.¹

8
- 0003657590
- Addison-Wesley, Reading, MA
- D.E. Knuth, The Art of Computer Programming, vol. 1: Fundamental Algorithms, 2nd ed., Addison-Wesley, Reading, MA, 1973.
- (1973) The Art of Computer Programming, Vol. 1: Fundamental Algorithms, 2nd Ed. , vol.1
- Knuth, D.E.¹

9
- 0003686156
- North-Holland, Amsterdam
- L. Lovász, Combinatorial Problems and Exercises, North-Holland, Amsterdam, 1979.
- (1979) Combinatorial Problems and Exercises
- Lovász, L.¹

10
- 0015770335
- Computing permutations with double-ended queues, parallel stacks, and parallel queries
- V.R. Pratt, Computing permutations with double-ended queues, parallel stacks, and parallel queries, in: Proc. 5th ACM Symp. on Theory of Computing, 1973, pp. 268-277.
- (1973) Proc. 5th ACM Symp. on Theory of Computing , pp. 268-277
- Pratt, V.R.¹

11
- 0041527046
- Stack-sortable permutations
- D. Rotem, Stack-sortable permutations, Discrete Math. 33 (1981) 185-196.
- (1981) Discrete Math. , vol.33 , pp. 185-196
- Rotem, D.¹

12
- 0000526470
- Bootstrap percolation, the Schröder number, and the N-kings problem
- L. Shapiro, A.B. Stephens, Bootstrap percolation, the Schröder number, and the N-kings problem, SIAM J. Discrete Math. 2 (1991) 275-280.
- (1991) SIAM J. Discrete Math. , vol.2 , pp. 275-280
- Shapiro, L.¹ Stephens, A.B.²

13
- 84861133916
- Restricted permutations
- R. Simion, F.W. Schmidt, Restricted permutations, European J. Combinatorics 6 (1985) 383-405.
- (1985) European J. Combinatorics , vol.6 , pp. 383-405
- Simion, R.¹ Schmidt, F.W.²

14
- 0000123938
- Forbidden subsequences
- to appear
- Z. Stankova, Forbidden subsequences. Discrete Math. (to appear).
- Discrete Math.
- Stankova, Z.¹

15
- 84976820924
- Sorting using networks of queues and stacks
- R. Tarjan, Sorting using networks of queues and stacks, J. ACM 19 (1972) 341-346.
- (1972) J. ACM , vol.19 , pp. 341-346
- Tarjan, R.¹

16
- 0000464149
- Generating trees and the Catalan and Schröder numbers
- J. West, Generating trees and the Catalan and Schröder numbers, Discrete Math. 146 (1995) 247-262.
- (1995) Discrete Math. , vol.146 , pp. 247-262
- West, J.¹

17
- 0042028153
- Generating trees and forbidden subsequences
- DIMACS
- J. West, Generating trees and forbidden subsequences, extended abstract, poster session, 6th Conf. Formal Power Series, DIMACS, 1994.
- (1994) 6th Conf. Formal Power Series
- West, J.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.