Practical algorithms for MSO model-checking on tree-decomposable graphs
Authors:
- Alexander LangerALAlexander Langer
- Felix ReidlFRFelix Reidl
- Peter RossmanithPRPeter Rossmanith
- Somnath SikdarSSSomnath Sikdar
- 1 November 2014
- journal article
- Published by Elsevier in Computer Science Review
- Vol. 13-14, 39-74
Abstract
No abstract availableThis publication has 84 references indexed in Scilit:
- Polynomial-time recognition of clique-width ≤3 graphsDiscrete Applied Mathematics, 2012
- Querying business processes with BP-QLInformation Systems, 2008
- Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar GraphsAlgorithmica, 2002
- Which Problems Have Strongly Exponential Complexity?Journal of Computer and System Sciences, 2001
- Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphsAlgorithmica, 1995
- Optimization, approximation, and complexity classesJournal of Computer and System Sciences, 1991
- Linear time algorithms for NP-hard problems restricted to partial k-treesDiscrete Applied Mathematics, 1989
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A surveyBIT Numerical Mathematics, 1985
- Complete sets and the polynomial-time hierarchyTheoretical Computer Science, 1976
- Generalized finite automata theory with an application to a decision problem of second-order logicTheory of Computing Systems, 1968