Pages that link to "Item:Q972346"
From MaRDI portal
The following pages link to On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width (Q972346):
Displaying 37 items.
- Courcelle's theorem -- a game-theoretic approach (Q408375) (← links)
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- Boolean-width of graphs (Q719257) (← links)
- Are there any good digraph width measures? (Q896003) (← links)
- Meta-kernelization with structural parameters (Q896025) (← links)
- \(H\)-join decomposable graphs and algorithms with runtime single exponential in rankwidth (Q972341) (← links)
- Graph operations characterizing rank-width (Q1028455) (← links)
- On the complexity of rainbow coloring problems (Q1647834) (← links)
- A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion (Q1672007) (← links)
- Solving problems on graphs of high rank-width (Q1709595) (← links)
- Automata for the verification of monadic second-order graph properties (Q1948277) (← links)
- Measuring what matters: a hybrid approach to dynamic programming with treewidth (Q2040028) (← links)
- On width measures and topological problems on semi-complete digraphs (Q2312615) (← links)
- The rank-width of edge-coloured graphs (Q2392245) (← links)
- An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion (Q2408197) (← links)
- Meta-kernelization using well-structured modulators (Q2413976) (← links)
- Fast exact algorithms for some connectivity problems parameterized by clique-width (Q2420640) (← links)
- Digraph width measures in parameterized algorithmics (Q2442211) (← links)
- Myhill-Nerode Methods for Hypergraphs (Q2872101) (← links)
- Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics (Q2891355) (← links)
- Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
- Thread Graphs, Linear Rank-Width and Their Algorithmic Applications (Q3000492) (← links)
- Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory (Q3010429) (← links)
- On the Boolean-Width of a Graph: Structure and Applications (Q3057622) (← links)
- New Results on the Complexity of the Max- and Min-Rep Problems (Q3075522) (← links)
- Solving Problems on Graphs of High Rank-Width (Q3449829) (← links)
- Graph Operations Characterizing Rank-Width and Balanced Graph Expressions (Q3508555) (← links)
- Boolean-Width of Graphs (Q3656851) (← links)
- Transforming graph states using single-qubit operations (Q4561771) (← links)
- Multi-clique-width (Q4638063) (← links)
- More Applications of the $d$-Neighbor Equivalence: Acyclicity and Connectivity Constraints (Q5009336) (← links)
- (Q5075752) (← links)
- Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth. (Q5092404) (← links)
- Clique-width of point configurations (Q5918571) (← links)
- Hardness transitions and uniqueness of acyclic colouring (Q6145810) (← links)
- Slim tree-cut width (Q6586668) (← links)
- Fast FPT-approximation of branchwidth (Q6593764) (← links)
