메뉴 건너뛰기




Volumn 38, Issue 3, 1989, Pages 353-366

Tree clustering for constraint networks

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING--ALGORITHMS; DATABASE SYSTEMS; MATHEMATICAL TECHNIQUES--TREES;

EID: 0024640050     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/0004-3702(89)90037-4     Document Type: Article
Times cited : (415)

References (25)
  • 13
    • 0018031196 scopus 로고
    • Synthesizing constraint expressions
    • (1978) Commun. ACM , vol.21 , Issue.11 , pp. 958-965
    • Freuder1
  • 14
    • 0019899621 scopus 로고
    • A sufficient condition of backtrack-free search
    • (1982) J. ACM , vol.29 , Issue.1 , pp. 24-32
    • Freuder1
  • 20
    • 0016050041 scopus 로고
    • Networks of constraints: Fundamental properties and applications to picture processing
    • (1974) Inf. Sci. , vol.7 , pp. 95-132
    • Montanari1
  • 23
  • 25
    • 0021473698 scopus 로고
    • Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs and selectively reduce acyclic hypergraphs
    • (1984) SIAM J. Comput. , vol.13 , Issue.3 , pp. 566-579
    • Tarjan1    Yannakakis2


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