메뉴 건너뛰기




Volumn 78, Issue 1-3, 1997, Pages 51-60

A special case for subset interconnection designs

Author keywords

[No Author keywords available]

Indexed keywords


EID: 10644239705     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0166-218x(97)00023-1     Document Type: Article
Times cited : (5)

References (7)
  • 1
    • 0020782108 scopus 로고
    • On the decidability of acyclic database schemes
    • C. Beeri, R. Fagin, D. Maier, M. Yannakakis, On the decidability of acyclic database schemes, J. ACM 30 (1983) 479-513.
    • (1983) J. ACM , vol.30 , pp. 479-513
    • Beeri, C.1    Fagin, R.2    Maier, D.3    Yannakakis, M.4
  • 2
    • 0347406262 scopus 로고
    • Placement of valves in vacuum systems
    • in Chinese
    • D.-Z. Du, Y.-M. Chen, Placement of valves in vacuum systems, J. Electric Light Sources 4 (1976) (in Chinese).
    • (1976) J. Electric Light Sources , vol.4
    • Du, D.-Z.1    Chen, Y.-M.2
  • 3
    • 30244485297 scopus 로고
    • On complexity of subset interconnection designs
    • D.-Z. Du, D.F. Kelley, On complexity of subset interconnection designs, J. Global Optimization 6 (1995) 193-205.
    • (1995) J. Global Optimization , vol.6 , pp. 193-205
    • Du, D.-Z.1    Kelley, D.F.2
  • 4
    • 0348037092 scopus 로고
    • Matroids and subset interconnection design
    • D.-Z. Du, Z. Miller, Matroids and subset interconnection design, SIAM J. Discrete. Math. 1 (1988) 416-424.
    • (1988) SIAM J. Discrete. Math. , vol.1 , pp. 416-424
    • Du, D.-Z.1    Miller, Z.2
  • 6
    • 0348037091 scopus 로고
    • Two algorithms for the subset interconnection design
    • E. Prisner, Two algorithms for the subset interconnection design, Networks, 22 (1992) 385-395.
    • (1992) Networks , vol.22 , pp. 385-395
    • Prisner, E.1
  • 7
    • 0021473698 scopus 로고
    • Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs
    • R.E. Tarjan, M. Yannakakis, Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs, SIAM J. Comput. 13 (1984) 566-579.
    • (1984) SIAM J. Comput. , vol.13 , pp. 566-579
    • Tarjan, R.E.1    Yannakakis, M.2


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