메뉴 건너뛰기




Volumn 27, Issue 4, 1998, Pages 942-959

Approximation algorithms for the feedback vertex set problem with applications to constraint satisfaction and bayesian inference

Author keywords

Approximation algorithms; Bayesian networks; Combinatorial optimization; Constraint satisfaction; Vertex feedback set

Indexed keywords


EID: 0001621179     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539796305109     Document Type: Article
Times cited : (148)

References (1)
  • 1
    • 0028255806 scopus 로고
    • Approximation algorithms for NP-complete problems on planar graphs
    • [Bak94]
    • [Bak94] B. S. BAKER, Approximation algorithms for NP-complete problems on planar graphs, J. Assoc. Comput. Mach., 41 (1994), pp. 153-180.
    • (1994) J. Assoc. Comput. Mach. , vol.41 , pp. 153-180
    • Baker, B.S.1


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