Matches in DBpedia 2015-10 for { ?s ?p "In the study of graph algorithms, Courcelle's theorem is the statement that every graph property definable in the monadic second-order logic of graphs can be decided in linear time on graphs of bounded treewidth. The result was first proved by Bruno Courcelle in 1990 and independently rediscovered by Borie, Parker & Tovey (1992).It is considered the archetype of algorithmic meta-theorems."@en }
Showing triples 1 to 2 of
2
with 100 triples per page.
- Courcelles_theorem abstract "In the study of graph algorithms, Courcelle's theorem is the statement that every graph property definable in the monadic second-order logic of graphs can be decided in linear time on graphs of bounded treewidth. The result was first proved by Bruno Courcelle in 1990 and independently rediscovered by Borie, Parker & Tovey (1992).It is considered the archetype of algorithmic meta-theorems.".
- Courcelles_theorem comment "In the study of graph algorithms, Courcelle's theorem is the statement that every graph property definable in the monadic second-order logic of graphs can be decided in linear time on graphs of bounded treewidth. The result was first proved by Bruno Courcelle in 1990 and independently rediscovered by Borie, Parker & Tovey (1992).It is considered the archetype of algorithmic meta-theorems.".