Abstract
Algorithmic meta-theorems are algorithmic results that apply to a whole range of problems, instead of addressing just one specific problem. This kind of theorems are often stated relative to a certain class of graphs, so the general form of a meta theorem reads “every problem in a certain class Open image in new window of problems can be solved efficiently on every graph satisfying a certain property Open image in new window ”. A particularly well known example of a meta-theorem is Courcelle’s theorem that every decision problem definable in monadic second-order logic (MSO) can be decided in linear time on any class of graphs of bounded tree-width [1].
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
