Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:02926844n
Noun Concept
Categories: Graph minor theory, Metatheorems, Graph algorithms
EN
Courcelle's theorem
EN
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. Wikipedia
Definitions
Relations
Sources
EN
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. Wikipedia
NAMED AFTER
Bruno Courcelle
Wikipedia
EN
Courcelle's theorem
Wikidata
EN
Courcelle's theorem

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License