Pages that link to "Item:Q5902074"
From MaRDI portal
The following pages link to Finding Branch-Decompositions and Rank-Decompositions (Q5902074):
Displayed 40 items.
- Tight complexity bounds for FPT subgraph problems parameterized by the clique-width (Q388791) (← links)
- On the model-checking of monadic second-order formulas with edge set quantifications (Q415286) (← links)
- Decomposition width of matroids (Q415290) (← links)
- Well-quasi-ordering of matrices under Schur complement and applications to directed graphs (Q449209) (← links)
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- Monadic second-order model-checking on decomposable matroids (Q548278) (← links)
- Compact labelings for efficient first-order model-checking (Q626458) (← links)
- Boolean-width of graphs (Q719257) (← links)
- Meta-kernelization with structural parameters (Q896025) (← links)
- \(H\)-join decomposable graphs and algorithms with runtime single exponential in rankwidth (Q972341) (← links)
- The rank-width of the square grid (Q972345) (← links)
- On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width (Q972346) (← links)
- Computing rank-width exactly (Q989474) (← links)
- Solving problems on graphs of high rank-width (Q1709595) (← links)
- Automata for the verification of monadic second-order graph properties (Q1948277) (← links)
- Structural parameters for scheduling with assignment restrictions (Q2205947) (← links)
- Algorithms for propositional model counting (Q2266937) (← links)
- The rank-width of edge-coloured graphs (Q2392245) (← links)
- Rank-width: algorithmic and structural results (Q2403788) (← links)
- Meta-kernelization using well-structured modulators (Q2413976) (← links)
- Digraph width measures in parameterized algorithmics (Q2442211) (← links)
- Latency-bounded target set selection in social networks (Q2447759) (← links)
- A SAT Approach to Branchwidth (Q2818011) (← links)
- Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width (Q2891349) (← links)
- Finding Good Decompositions for Dynamic Programming on Dense Graphs (Q2891352) (← links)
- Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory (Q3010429) (← links)
- $\mathbb F$ -Rank-Width of (Edge-Colored) Graphs (Q3014938) (← links)
- Digraphs of Bounded Width (Q3120441) (← links)
- Containment of Monadic Datalog Programs via Bounded Clique-Width (Q3449494) (← links)
- Solving Problems on Graphs of High Rank-Width (Q3449829) (← links)
- Boolean-Width of Graphs (Q3656851) (← links)
- On Digraph Width Measures in Parameterized Algorithmics (Q3656861) (← links)
- Covering Vectors by Spaces: Regular Matroids (Q4555045) (← links)
- A Simpler Self-reduction Algorithm for Matroid Path-Width (Q4569568) (← links)
- (Q4625695) (← links)
- (Q4638063) (← links)
- Inductive computations on graphs defined by clique-width expressions (Q5321781) (← links)
- Polynomial Time Algorithms for Computing a Minimum Hull Set in Distance-Hereditary and Chordal Graphs (Q5890507) (← links)
- Computing with Tangles (Q5890774) (← links)
- Parameterized shifted combinatorial optimization (Q5915595) (← links)