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.
- Posets with interfaces as a model for concurrency (Q2672275) (← links)
- FPT algorithms to compute the elimination distance to bipartite graphs and more (Q2672425) (← links)
- Transformation of variants of Petri nets into context-dependent fusion grammars (Q2672655) (← links)
- The Caucal hierarchy: interpretations in the (W)MSO+\(\mathsf{U}\) logic (Q2672657) (← links)
- Graph planning with expected finite horizon (Q2672939) (← links)
- Computing the best-case energy complexity of satisfying assignments in monotone circuits (Q2674710) (← links)
- On the computational complexity of the bipartizing matching problem (Q2675722) (← links)
- Parameterized complexity of computing maximum minimal blocking and hitting sets (Q2684484) (← links)
- FPT and kernelization algorithms for the induced tree problem (Q2692722) (← links)
- Perfectly matched sets in graphs: parameterized and exact computation (Q2697539) (← links)
- Parameterized Complexity of CTL (Q2799205) (← links)
- Verification of Parameterized Communicating Automata via Split-Width (Q2811340) (← links)
- Strong Backdoors for Default Logic (Q2818000) (← links)
- Exploiting chordal structure in polynomial ideals: a Gröbner bases approach (Q2818203) (← links)
- Causality in Bounded Petri Nets is MSO Definable (Q2820695) (← links)
- Beyond Classes of Graphs with “Few” Minimal Separators: FPT Results Through Potential Maximal Cliques (Q2827832) (← links)
- A Practical Algorithm for the Uniform Membership Problem of Labeled Multidigraphs of Tree-Width 2 for Spanning Tree Automata (Q2830211) (← links)
- Myhill-Nerode Methods for Hypergraphs (Q2872101) (← links)
- Relating Paths in Transition Systems: The Fall of the Modal Mu-Calculus (Q2946334) (← links)
- Regularity Equals Monadic Second-Order Definability for Quasi-trees (Q2947169) (← links)
- Capturing MSO with One Quantifier (Q2947170) (← links)
- Large Induced Subgraphs via Triangulations and CMSO (Q2954371) (← links)
- Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth (Q2968151) (← links)
- Unified Reasoning About Robustness Properties of Symbolic-Heap Separation Logic (Q2988661) (← links)
- On the Computational Complexity of Variants of Combinatorial Voter Control in Elections (Q2988834) (← links)
- Digraphs of Bounded Width (Q3120441) (← links)
- Graph Transformation Meets Reversible Circuits: Model Transformation and Optimization (Q3187814) (← links)
- Property Testing for Bounded Degree Databases (Q3304100) (← links)
- (Q3386623) (← links)
- A New Approach for Contact Graph Representations and Its Applications (Q3449814) (← links)
- Graph Structure and Monadic Second-Order Logic: Language Theoretical Aspects (Q3521904) (← links)
- Monadic Second-Order Logic for Graphs: Algorithmic and Language Theoretical Applications (Q3618564) (← links)
- (Q4205068) (← links)
- (Q4241260) (← links)
- (Q4273871) (← links)
- Prefix-Recognizable Graphs and Monadic Logic (Q4412838) (← links)
- Recognizable languages of arrows and cospans (Q4585008) (← links)
- A Practical Algorithm for the Uniform Membership Problem of Labeled Multidigraphs of Tree-Width 2 for Spanning Tree Automata (Q4605514) (← links)
- Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth (Q4611385) (← links)
- Beyond Outerplanarity (Q4625142) (← links)
- (Q4625695) (← links)
- Model checking existential logic on partially ordered sets (Q4635604) (← links)
- (Q4643961) (← links)
- (Q5002765) (← links)
- (Q5002801) (← links)
- Reducing CMSO model checking to highly connected graphs (Q5002822) (← links)
- Recovering sparse graphs (Q5005129) (← links)
- Treewidth-two graphs as a free algebra (Q5005163) (← links)
- (Q5013881) (← links)
- Betweenness of partial orders (Q5021103) (← links)
