Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Courcelle's_theorem> ?p ?o }
Showing triples 1 to 14 of
14
with 100 triples per page.
- Courcelle's_theorem abstract "In the study of graph algorithms, Courcelle's theorem is the statement that every graph property definable in monadic second-order logic can be decided in linear time on graphs of bounded treewidth. The result was first proved by Bruno Courcelle in 1990 and is considered the archetype of algorithmic meta-theorems.".
- Courcelle's_theorem wikiPageID "35810608".
- Courcelle's_theorem wikiPageRevisionID "596872490".
- Courcelle's_theorem hasPhotoCollection Courcelle's_theorem.
- Courcelle's_theorem subject Category:Graph_algorithms.
- Courcelle's_theorem subject Category:Graph_minor_theory.
- Courcelle's_theorem subject Category:Metatheorems.
- Courcelle's_theorem comment "In the study of graph algorithms, Courcelle's theorem is the statement that every graph property definable in monadic second-order logic can be decided in linear time on graphs of bounded treewidth. The result was first proved by Bruno Courcelle in 1990 and is considered the archetype of algorithmic meta-theorems.".
- Courcelle's_theorem label "Courcelle's theorem".
- Courcelle's_theorem sameAs m.0jt8bld.
- Courcelle's_theorem sameAs Q5178114.
- Courcelle's_theorem sameAs Q5178114.
- Courcelle's_theorem wasDerivedFrom Courcelle's_theorem?oldid=596872490.
- Courcelle's_theorem isPrimaryTopicOf Courcelle's_theorem.