메뉴 건너뛰기




Volumn 1, Issue , 1999, Pages 157-167

A study of constraint management integration into the conceptual design phase

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED DESIGN; CONCEPTUAL DESIGN; GRAPH THEORY;

EID: 27544478906     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1115/DETC99/DAC-8680     Document Type: Conference Paper
Times cited : (5)

References (18)
  • 7
    • 0026104496 scopus 로고
    • Computing a maximum cardinality matching in a bipartite graph in time 0(..)
    • Mehlhorn, K., Alt, H., and Blum, N., Computing a maximum cardinality matching in a bipartite graph in time 0(..), Information Processing Letters, Vol. 37, Number 4, Pages 237-240, 1991.
    • (1991) Information Processing Letters , vol.37 , Issue.4 , pp. 237-240
    • Mehlhorn, K.1    Alt, H.2    Blum, N.3
  • 13
  • 14
    • 0004286902 scopus 로고
    • Chapter 32, Pages Addison-Wesley Publishing Co
    • Sedgewick, R., Algorithms in C, Chapter 32, Pages 479-483, Addison-Wesley Publishing Co., 1990.
    • (1990) Algorithms in C , pp. 479-483
    • Sedgewick, R.1
  • 16
    • 0002159082 scopus 로고
    • Gero, J. S., Pages Kluwer Academic Publishers
    • Sriram, D., in Artificial Intelligence in Design'92, Gero, J. S., Pages 97-117, Kluwer Academic Publishers, 1992.
    • (1992) Artificial Intelligence in Design'92 , pp. 97-117
    • Sriram, D.1


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