Compact labelings for efficient first-order model-checking-Reference-Cited by-同舟云学术

Compact labelings for efficient first-order model-checking

Published:2009-08-27 Issue:1 Volume:21 Page:19-46
ISSN:1382-6905
Container-title:Journal of Combinatorial Optimization
language:en
Short-container-title:J Comb Optim

Author:

Courcelle Bruno,Gavoille Cyril,Kanté Mamadou Moustapha

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications

Link

http://link.springer.com/content/pdf/10.1007/s10878-009-9260-7.pdf

Reference31 articles.

1. Arnborg S, Lagergren J, Seese D (1991) Easy problems for tree-decomposable graphs. J Algorithms 12(2):308–340

2. Bagan G (2009) Algorithmes et complexité des problèmes d’énumération pour l’évaluation de requêtes logiques. PhD Thesis, Université de Caen/Basse Normandie, Caen

3. Blumensath A, Courcelle B (2006) Recognizability, hypergraph operations and logical types. Inf Comput 204(6):853–919

4. Bodlaender HL (1996) A linear-time algorithm for finding tree-decompositions of small tree-width. SIAM J Comput 25(6):1305–1317

5. LNCS;HL Bodlaender,2007

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

1. Implicit Representation of Relations;Theory of Computing Systems;2023-08-15

2. Fault-tolerant distance labeling for planar graphs;Theoretical Computer Science;2022-05

3. Fault-Tolerant Distance Labeling for Planar Graphs;Structural Information and Communication Complexity;2021

4. On low rank-width colorings;European Journal of Combinatorics;2020-01

5. Graph Structure and Monadic Second-Order Logic;ENCYCLOP MATH APPL;2009