메뉴 건너뛰기
Theoretical Computer Science
Volumn 224, Issue 1-2, 1999, Pages 35-58
The monadic second-order logic of graphs XI: Hierarchical decompositions of connected graphs
Author keywords

3 connected graph; Block; Directed acyclic graph; Graph; Monadic second order logic; Tree
Indexed keywords

EID: 0346304172     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00306-5     Document Type: Article
Times cited : (14)
References (17)
  • 2
    • 0025398865 scopus 로고
    • The monadic second-order logic of graphs I: Recognizable sets of finite graphs
    • B. Courcelle, The monadic second-order logic of graphs I: Recognizable sets of finite graphs, Inform. Comput. 85 (1990) 12-75.
    • (1990) Inform. Comput. , vol.85 , pp. 12-75
    • Courcelle, B.1
  • 3
    • 0026123837 scopus 로고
    • The monadic second-order logic of graphs V: On closing the gap between definability and recognizability
    • B. Courcelle, The monadic second-order logic of graphs V: On closing the gap between definability and recognizability, Theoret. Comput. Sci. 80 (1991) 153-202.
    • (1991) Theoret. Comput. Sci. , vol.80 , pp. 153-202
    • Courcelle, B.1
  • 4
    • 0000880574 scopus 로고
    • The monadic second-order logic of graphs VI: On several representations of graphs by relational structures
    • B. Courcelle, The monadic second-order logic of graphs VI: On several representations of graphs by relational structures, Discrete Appl. Math. 54 (1994) 117-149.
    • (1994) Discrete Appl. Math. , vol.54 , pp. 117-149
    • Courcelle, B.1
  • 5
    • 0028420231 scopus 로고
    • Monadic second-order definable graph transductions: A survey
    • B. Courcelle, Monadic second-order definable graph transductions: a survey, Theoret. Comput. Sci. 126 (1994) 53-75.
    • (1994) Theoret. Comput. Sci. , vol.126 , pp. 53-75
    • Courcelle, B.1
  • 6
    • 0001530073 scopus 로고
    • The monadic second-order logic of graphs VIII: Orientations
    • B. Courcelle, The monadic second-order logic of graphs VIII: orientations, Ann. Pure Appl. Logic 72 (1995) 103-143.
    • (1995) Ann. Pure Appl. Logic , vol.72 , pp. 103-143
    • Courcelle, B.1
  • 7
    • 0030169923 scopus 로고    scopus 로고
    • The monadic second-order logic of graphs X: Linear orders
    • B. Courcelle, The monadic second-order logic of graphs X: linear orders, Theoret. Comput. Sci. 160 (1996) 87-143.
    • (1996) Theoret. Comput. Sci. , vol.160 , pp. 87-143
    • Courcelle, B.1
  • 8
    • 0000090439 scopus 로고    scopus 로고
    • The expression of graph properties and graph transformations in monadic second-order logic
    • Ch. 5 in: G. Rozenberg (Ed.), World Scientific, New Jersey, London
    • B. Courcelle, The expression of graph properties and graph transformations in monadic second-order logic, Ch. 5 in: G. Rozenberg (Ed.), Handbook of Graph Grammars and Computing by Graph Transformations, vol. 1 : Foundations, World Scientific, New Jersey, London, 1997, pp. 313-400.
    • (1997) Handbook of Graph Grammars and Computing by Graph Transformations, Vol. 1 : Foundations , vol.1 , pp. 313-400
    • Courcelle, B.1
  • 10
    • 0027553197 scopus 로고
    • Monadic second-order evaluation of tree-decomposable graphs
    • B. Courcelle, M. Mosbah, Monadic second-order evaluation of tree-decomposable graphs, Theoret. Comput. Sci. 109 (1993) 49-82.
    • (1993) Theoret. Comput. Sci. , vol.109 , pp. 49-82
    • Courcelle, B.1    Mosbah, M.2
  • 12
    • 0027557446 scopus 로고
    • Recognising k-connected hypergraphs in cubic time
    • F. Drewes, Recognising k-connected hypergraphs in cubic time, Theoret. Comput. Sci. 109 (1993) 83-122.
    • (1993) Theoret. Comput. Sci. , vol.109 , pp. 83-122
    • Drewes, F.1
  • 13
    • 0345762007 scopus 로고
    • Efficient algorithms and partial k-trees; References
    • S. Hedetniemi, Efficient algorithms and partial k-trees; References. Discrete Appl. Math. 54 (1994) 281-290.
    • (1994) Discrete Appl. Math. , vol.54 , pp. 281-290
    • Hedetniemi, S.1
  • 14
    • 84951085310 scopus 로고    scopus 로고
    • Recognizability equals definability for partial k-paths
    • Proc. of ICALP'1997
    • V. Kabanets, Recognizability equals definability for partial k-paths, Proc. of ICALP'1997, Lecture Notes in Compter Science, Vol. 1256, pp. 805-815, 1997.
    • (1997) Lecture Notes in Compter Science , vol.1256 , pp. 805-815
    • Kabanets, V.1
  • 15
    • 84896692694 scopus 로고    scopus 로고
    • Definability equals recognizability for partial 3-trees
    • Proc. WG'96
    • D. Kaller, Definability equals recognizability for partial 3-trees, Proc. WG'96, Lecture Notes in Computer Science, Vol. 1197, pp. 239-253, 1996.
    • (1996) Lecture Notes in Computer Science , vol.1197 , pp. 239-253
    • Kaller, D.1
  • 16
    • 78649882717 scopus 로고    scopus 로고
    • Recognizability equals monadic second-order definability for sets of graphs of bounded tree-width
    • Proc. STACS 1998
    • D. Lapoire, Recognizability equals monadic second-order definability for sets of graphs of bounded tree-width, Proc. STACS 1998, Lecture Notes in Computer Science, Vol. 1373, pp. 618-628, 1998.
    • (1998) Lecture Notes in Computer Science , vol.1373 , pp. 618-628
    • Lapoire, D.1
  • 17
    • 0003702909 scopus 로고
    • Addison-Wesley, Reading, MA
    • W. Tutte, Graph Theory, Addison-Wesley, Reading, MA, 1984.
    • (1984) Graph Theory
    • Tutte, W.1

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