메뉴 건너뛰기
Discrete Mathematics
Volumn 163, Issue 1-3, 1997, Pages 139-151
Finding parity difference by involutions
Author keywords

[No Author keywords available]
Indexed keywords

EID: 0043265959     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0012-365X(95)00339-X     Document Type: Article
Times cited : (4)
References (15)
  • 1
    • 0016994626 scopus 로고
    • Efficient generation of the binary reflected gray code and its applications
    • J.R. Bittner, G. Ehrlich and E.M. Reingold, Efficient generation of the binary reflected gray code and its applications, Comm. ACM 19 (1976) 517-521.
    • (1976) Comm. ACM , vol.19 , pp. 517-521
    • Bittner, J.R.1    Ehrlich, G.2    Reingold, E.M.3
  • 2
    • 0013157009 scopus 로고
    • Counting linear extensions
    • G. Brightwell and P. Winkler, Counting linear extensions, Order 8 (1991) 225-242.
    • (1991) Order , vol.8 , pp. 225-242
    • Brightwell, G.1    Winkler, P.2
  • 3
    • 0042811989 scopus 로고
    • Gray codes with restricted density
    • M. Buck and D. Wiedemann, Gray codes with restricted density, Discrete Math. 48 (1984) 163-171.
    • (1984) Discrete Math. , vol.48 , pp. 163-171
    • Buck, M.1    Wiedemann, D.2
  • 4
    • 84968488129 scopus 로고
    • Generation of permutations by adjacent transpositions
    • S.M. Johnson, Generation of permutations by adjacent transpositions, Math. Comp. 17 (1963) 282-285.
    • (1963) Math. Comp. , vol.17 , pp. 282-285
    • Johnson, S.M.1
  • 5
    • 38249026928 scopus 로고
    • Solution of some multi-dimensional lattice path parity difference recurrence relations
    • C.W. Ko and F. Ruskey, Solution of some multi-dimensional lattice path parity difference recurrence relations, Discrete Math. 71 (1988) 47-56.
    • (1988) Discrete Math. , vol.71 , pp. 47-56
    • Ko, C.W.1    Ruskey, F.2
  • 7
    • 0041810111 scopus 로고
    • Solution of some parity difference recurrence relations using involutions
    • F. Ruskey, Solution of some parity difference recurrence relations using involutions, Congr. Numer. 59 (1987) 257-264.
    • (1987) Congr. Numer. , vol.59 , pp. 257-264
    • Ruskey, F.1
  • 8
    • 0041309452 scopus 로고
    • Research problem 90
    • F. Ruskey, Research problem 90, Discrete Math. 70 (1988) 111-112.
    • (1988) Discrete Math. , vol.70 , pp. 111-112
    • Ruskey, F.1
  • 9
    • 0008059378 scopus 로고
    • Generating linear extensions of posets by transpositions
    • F. Ruskey, Generating linear extensions of posets by transpositions, J. Combin. Theory Ser. B 54 (1992) 71-101.
    • (1992) J. Combin. Theory Ser. B , vol.54 , pp. 71-101
    • Ruskey, F.1
  • 10
    • 0042811985 scopus 로고
    • Hamilton paths in graphs of linear extensions for unions of posets
    • G. Stachowiak, Hamilton paths in graphs of linear extensions for unions of posets, SIAM J. Discrete Math.5 (1992) 199-206.
    • (1992) SIAM J. Discrete Math. , vol.5 , pp. 199-206
    • Stachowiak, G.1
  • 14
    • 84945709722 scopus 로고    scopus 로고
    • Perm
    • H.F. Trotter, Algorithm 115; Perm, Comm. ACM 5 (1962) 434-435.
    • (1962) Comm. ACM , vol.5 , pp. 434-435
  • 15
    • 0009315184 scopus 로고
    • Generating trees and other combinatorial objects lexicographically
    • S. Zaks and D. Richards, Generating trees and other combinatorial objects lexicographically, SIAM J. Comput. 8 (1979) 73-81.
    • (1979) SIAM J. Comput. , vol.8 , pp. 73-81
    • Zaks, S.1    Richards, D.2

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