The modular decomposition of countable graphs. Definition and construction in monadic second-order logic-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

The modular decomposition of countable graphs. Definition and construction in monadic second-order logic

Published:2008-03 Issue:1-2 Volume:394 Page:1-38
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Courcelle Bruno,Delhommé Christian

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference44 articles.

1. When can an equational simple graph be generated by hyperedge replacement?;Barthelmann,1998

2. Towards a characterization of order-invariant queries over tame structures;Benedikt,2005

3. Finite presentations of infinite structures: Automata and interpretations;Blumensath;Theory of Computing Systems,2004

4. The Caucal hierarchy of infinite graphs in terms of logic and higher-order pushdown automata;Carayol,2003

5. On the regular structure of prefix rewriting;Caucal;Theoretical Computer Science,1992

Cited by 16 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Well-quasi-ordering and Embeddability of Relational Structures;Order;2024-04

2. A Proof of the Alternate Thomassé Conjecture for Countable N-Free Posets;Order;2023-11-20

3. Algebras, Graphs and Ordered Sets – ALGOS 2020 & the Mathematical Contributions of Maurice Pouzet;Order;2023-05-17

4. F3-Reconstruction and Bi-Founded 2-Structures;Order;2023-02-27

5. An Analytic Propositional Proof System on Graphs;Logical Methods in Computer Science;2022-10-21

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP