Pages that link to "Item:Q685464"

The following pages link to Monadic second-order evaluations on tree-decomposable graphs (Q685464):

Displaying 50 items.

• Planar disjoint-paths completion (Q329285) (← links)
• Courcelle's theorem for triangulations (Q346450) (← links)
• Kernel bounds for path and cycle problems (Q392032) (← links)
• Courcelle's theorem -- a game-theoretic approach (Q408375) (← links)
• Confronting intractability via parameters (Q465686) (← links)
• Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
• Algorithms for decision problems in argument systems under preferred semantics (Q490457) (← links)
• \(k\)-chordal graphs: from cops and robber to compact routing via treewidth (Q494802) (← links)
• Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds. (Q512651) (← links)
• Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
• Basic notions of universal algebra for language theory and graph grammars (Q671349) (← links)
• A simple linear-time algorithm for finding path-decompositions of small width (Q672094) (← links)
• Safe separators for treewidth (Q819825) (← links)
• Trees, grids, and MSO decidability: from graphs to matroids (Q820150) (← links)
• A local characterization of bounded clique-width for line graphs (Q868337) (← links)
• Partitioning graphs of supply and demand (Q967306) (← links)
• Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width (Q1003668) (← links)
• On the OBDD size for graphs of bounded tree- and clique-width (Q1011721) (← links)
• The NLC-width and clique-width for powers of graphs of bounded tree-width (Q1028448) (← links)
• Decidability of the finiteness of ranges of tree transductions (Q1271464) (← links)
• All structured programs have small tree width and good register allocation (Q1271620) (← links)
• A partial k-arboretum of graphs with bounded treewidth (Q1274912) (← links)
• Nondeterministic operations on finite relational structures (Q1276248) (← links)
• Partial and perfect path covers of cographs (Q1281391) (← links)
• Monadic second-order definable graph transductions: a survey (Q1325847) (← links)
• Finite tree automata with cost functions (Q1325851) (← links)
• Probabilistic hyperedge replacement grammars (Q1351216) (← links)
• Logical description of context-free graph languages (Q1384534) (← links)
• Tree-width and the monadic quantifier hierarchy. (Q1401360) (← links)
• Query efficient implementation of graphs of bounded clique-width (Q1408820) (← links)
• The monadic second-order logic of graphs. XII: Planar graphs and planar maps (Q1566702) (← links)
• A comparison of tree transductions defined by monadic second order logic and by attribute grammars (Q1582010) (← links)
• Listing all potential maximal cliques of a graph (Q1605302) (← links)
• Deleting edges to restrict the size of an epidemic: a new application for treewidth (Q1635713) (← links)
• Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity (Q1687933) (← links)
• Querying linguistic treebanks with monadic second-order logic in linear time (Q1770837) (← links)
• On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph (Q1784741) (← links)
• A comparison of compatible, finite, and inductive graph properties (Q1812942) (← links)
• The monadic second-order logic of graphs. VIII: Orientations (Q1842126) (← links)
• The monadic second-order logic of graphs. XIV: Uniformly sparse graphs and edge set quantifica\-tions. (Q1874383) (← links)
• Algorithms for vertex-partitioning problems on graphs with fixed clique-width. (Q1874418) (← links)
• The monadic second-order logic of graphs. XI: Hierarchical decompositions of connected graphs (Q1960417) (← links)
• Upper bounds to the clique width of graphs (Q1975365) (← links)
• Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes (Q2018540) (← links)
• Galois connections for patterns: an algebra of labelled graphs (Q2044173) (← links)
• On knot-free vertex deletion: fine-grained parameterized complexity analysis of a deadlock resolution graph problem (Q2078619) (← links)
• Maximum matching in almost linear time on graphs of bounded clique-width (Q2093582) (← links)
• A new approach on locally checkable problems (Q2127611) (← links)
• A general framework for path convexities (Q2156285) (← links)
• Parameterized complexity of fair deletion problems (Q2174554) (← links)