Pages that link to "Item:Q3077955"
From MaRDI portal
The following pages link to Graph structure and monadic second-order logic. A language-theoretic approach (Q3077955):
Displaying 50 items.
- Measuring what matters: a hybrid approach to dynamic programming with treewidth (Q2040028) (← links)
- On knot-free vertex deletion: fine-grained parameterized complexity analysis of a deadlock resolution graph problem (Q2078619) (← links)
- Context-sensitive fusion grammars and fusion grammars with forbidden context are universal (Q2084774) (← links)
- Maximum matching in almost linear time on graphs of bounded clique-width (Q2093582) (← links)
- A meta-theorem for distributed certification (Q2097341) (← links)
- ASNP: a tame fragment of existential second-order logic (Q2106601) (← links)
- Shelah-Stupp's and Muchnik's iterations revisited (Q2117107) (← links)
- Verifying graph programs with monadic second-order logic (Q2117269) (← links)
- Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids (Q2136289) (← links)
- Regular model checking with regular relations (Q2140498) (← links)
- Verification of agent navigation in partially-known environments (Q2144175) (← links)
- Minimum \(t\)-spanners on subcubic graphs (Q2154116) (← links)
- A general framework for path convexities (Q2156285) (← links)
- An adjacency labeling scheme based on a decomposition of trees into caterpillars (Q2169946) (← links)
- Grammars and clique-width bounds from split decompositions (Q2174558) (← links)
- On quasi-planar graphs: clique-width and logical description (Q2174559) (← links)
- Subgraph complementation (Q2182091) (← links)
- Parameterized orientable deletion (Q2182093) (← links)
- Bisimulation invariant monadic-second order logic in the finite (Q2182315) (← links)
- Bundled crossings revisited (Q2206831) (← links)
- Graph theory in Coq: minors, treewidth, and isomorphisms (Q2209536) (← links)
- On caterpillar factors in graphs (Q2210502) (← links)
- XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles (Q2216430) (← links)
- How to compute digraph width measures on directed co-graphs (Q2220888) (← links)
- Classes of graphs with low complexity: the case of classes with bounded linear rankwidth (Q2225428) (← links)
- Fixed-treewidth-efficient algorithms for edge-deletion to interval graph classes (Q2232241) (← links)
- One-way resynchronizability of word transducers (Q2233399) (← links)
- Efficient computation of the oriented chromatic number of recursively defined digraphs (Q2235732) (← links)
- Rabin's theorem in the concurrency setting: a conjecture (Q2253187) (← links)
- Language theoretic properties of regular DAG languages (Q2272978) (← links)
- Nontrivial path covers of graphs: existence, minimization and maximization (Q2292153) (← links)
- On width measures and topological problems on semi-complete digraphs (Q2312615) (← links)
- Comparing linear width parameters for directed graphs (Q2322714) (← links)
- Linear rank-width and linear clique-width of trees (Q2346380) (← links)
- On labeled birooted tree languages: algebras, automata and logic (Q2347808) (← links)
- A characterisation of clique-width through nested partitions (Q2348055) (← links)
- Clique-width and edge contraction (Q2350597) (← links)
- The rank-width of edge-coloured graphs (Q2392245) (← links)
- Definability equals recognizability for \(k\)-outerplanar graphs and \(l\)-chordal partial \(k\)-trees (Q2403697) (← links)
- Tractability, hardness, and kernelization lower bound for and/or graph solution (Q2410230) (← links)
- Parameterized edge Hamiltonicity (Q2413968) (← links)
- Computing square roots of graphs with low maximum degree (Q2413970) (← links)
- From tree-decompositions to clique-width terms (Q2413974) (← links)
- Fast exact algorithms for some connectivity problems parameterized by clique-width (Q2420640) (← links)
- Specifying graph languages with type graphs (Q2423749) (← links)
- Logics for unordered trees with data constraints (Q2424682) (← links)
- The monadic quantifier alternation hierarchy over grids and graphs (Q2506497) (← links)
- Can one design a geometry engine? Can one design a geometry engine? On the (un)decidability of certain affine Euclidean geometries (Q2631966) (← links)
- Computability by monadic second-order logic (Q2656341) (← links)
- Deleting edges to restrict the size of an epidemic in temporal networks (Q2662670) (← links)
