Algorithmic meta theorems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5344 LNCS, Issue , 2008, Pages 30-

  Grohe, Martin ^a  

^a HUMBOLDT UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY; COMPUTERS; GRAPH THEORY; POLYNOMIAL APPROXIMATION; TECHNICAL PRESENTATIONS; TOPOLOGY;

APPROXIMATION RATIOS; COMBINATORIAL PROBLEMS; EXCLUDED MINORS; FIRST ORDERS; GRAPH PROPERTIES; LINEAR TIMES; META THEOREMS; OF GRAPHS; OPTIMISATION; PLANAR GRAPHS; POLYNOMIAL TIMES; SPECIFIC PROBLEMS; TECHNIQUES USED; TREE WIDTHS;

TREES (MATHEMATICS);

EID: 58349118626     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-92248-3_3     Document Type: Conference Paper

References (4)

1. Courcelle, B.: Graph rewriting: An algebraic and logic approach. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol. B, pp. 194-242. Elsevier Science Publishers, Amsterdam (1990)
2. Frick, M., Grohe, M.: Deciding first-order properties of locally tree-decomposable structures. Journal of the ACM 48, 1184-1206 (2001)
3. Dawar, A., Grohe, M., Kreutzer, S., Schweikardt, N.: Approximation schemes for first-order definable optimisation problems. In: Proceedings of the 21st IEEE Symposium on Logic in Computer Science, pp. 411-420 (2006)
4. Grohe, M.: Logic, graphs, and algorithms. In: Flum, J., Grädel, E., Wilke, T. (eds.) Logic and Automata - History and Perspectives. Texts in Logic and Games, vol. 2, pp. 357-422. Amsterdam University Press (2007)