메뉴 건너뛰기
Information Processing Letters
Volumn 103, Issue 4, 2007, Pages 136-141
A logical approach to multicut problems
Author keywords

Complexity; Fixed parameter tractability; Graph algorithms; Logic; Multicut; Networks; Parameterized complexity
Indexed keywords

FORMAL LOGIC; GRAPH THEORY; NUMERICAL METHODS; PARAMETER ESTIMATION; THEOREM PROVING;
EID: 34248524783     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2007.03.005     Document Type: Article
Times cited : (26)
References (11)
  • 1
    • 0000504885 scopus 로고
    • Easy problems for tree-decomposable graphs
    • Arnborg S., Lagergren J., and Seese D. Easy problems for tree-decomposable graphs. J. Algorithms 12 2 (1991) 308-340
    • (1991) J. Algorithms , vol.12 , Issue.2 , pp. 308-340
    • Arnborg, S.1    Lagergren, J.2    Seese, D.3
  • 2
    • 0042929930 scopus 로고    scopus 로고
    • Multicuts in unweighted graphs with bounded degree and bounded tree-width
    • Calinescu G., Fernandes C.G., and Reed B.A. Multicuts in unweighted graphs with bounded degree and bounded tree-width. J. Algorithms 48 2 (2003) 333-359
    • (2003) J. Algorithms , vol.48 , Issue.2 , pp. 333-359
    • Calinescu, G.1    Fernandes, C.G.2    Reed, B.A.3
  • 3
    • 0000809609 scopus 로고
    • Graph rewriting: an algebraic and logic approach
    • Formal Models and Semantics, Elsevier/MIT Press
    • Courcelle B. Graph rewriting: an algebraic and logic approach. Formal Models and Semantics. Handbook of Theoretical Computer Science vol. B (1990), Elsevier/MIT Press 193-242
    • (1990) Handbook of Theoretical Computer Science , vol.B , pp. 193-242
    • Courcelle, B.1
  • 7
    • 0346837920 scopus 로고    scopus 로고
    • Primal-dual approximation algorithms for integral flow and multicut in trees
    • Garg N., Vazirani V.V., and Yannakakis M. Primal-dual approximation algorithms for integral flow and multicut in trees. Algorithmica 181 (1997) 3-20
    • (1997) Algorithmica , vol.181 , pp. 3-20
    • Garg, N.1    Vazirani, V.V.2    Yannakakis, M.3
  • 8
    • 33745650658 scopus 로고    scopus 로고
    • Complexity and exact algorithms for multicut
    • SOFSEM. Wiedermann J., Tel G., Pokorný J., Bieliková M., and Stuller J. (Eds), Springer
    • Guo J., Hüffner F., Kenar E., Niedermeier R., and Uhlmann J. Complexity and exact algorithms for multicut. In: Wiedermann J., Tel G., Pokorný J., Bieliková M., and Stuller J. (Eds). SOFSEM. Lecture Notes in Comput. Sci. vol. 3831 (2006), Springer 303-312
    • (2006) Lecture Notes in Comput. Sci. , vol.3831 , pp. 303-312
    • Guo, J.1    Hüffner, F.2    Kenar, E.3    Niedermeier, R.4    Uhlmann, J.5
  • 9
    • 27744582441 scopus 로고    scopus 로고
    • Fixed-parameter tractability and data reduction for multicut in trees
    • Guo J., and Niedermeier R. Fixed-parameter tractability and data reduction for multicut in trees. Networks 46 3 (2005) 124-135
    • (2005) Networks , vol.46 , Issue.3 , pp. 124-135
    • Guo, J.1    Niedermeier, R.2
  • 10
    • 32144452810 scopus 로고    scopus 로고
    • Parameterized graph separation algorithms
    • Marx D. Parameterized graph separation algorithms. Theoret. Comput. Sci. 351 3 (2006) 394-406
    • (2006) Theoret. Comput. Sci. , vol.351 , Issue.3 , pp. 394-406
    • Marx, D.1
  • 11
    • 0000673493 scopus 로고
    • Graph minors. II. Algorithmic aspects of tree-width
    • Robertson N., and Seymour P.D. Graph minors. II. Algorithmic aspects of tree-width. J. Algorithms 7 3 (1986) 309-322
    • (1986) J. Algorithms , vol.7 , Issue.3 , pp. 309-322
    • Robertson, N.1    Seymour, P.D.2

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