Pages that link to "Item:Q2496203"
From MaRDI portal
The following pages link to Approximating clique-width and branch-width (Q2496203):
Displaying 50 items.
- Clique-width of path powers (Q266933) (← links)
- Tree-depth and vertex-minors (Q281932) (← links)
- Between treewidth and clique-width (Q300479) (← links)
- Model counting for CNF formulas of bounded modular treewidth (Q334935) (← links)
- Satisfiability of acyclic and almost acyclic CNF formulas (Q385062) (← links)
- Tight complexity bounds for FPT subgraph problems parameterized by the clique-width (Q388791) (← links)
- Graph classes with structured neighborhoods and algorithmic applications (Q392023) (← links)
- Colouring of graphs with Ramsey-type forbidden subgraphs (Q393895) (← links)
- Tree-representation of set families and applications to combinatorial decompositions (Q412262) (← links)
- Polynomial-time recognition of clique-width \(\leq 3\) graphs (Q415285) (← 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)
- The complexity of finding uniform sparsest cuts in various graph classes (Q450559) (← links)
- Clique-width with an inactive label (Q465271) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors (Q505914) (← links)
- Several notions of rank-width for countable graphs (Q505916) (← links)
- The behavior of clique-width under graph operations and graph transformations (Q519907) (← links)
- Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm (Q527431) (← links)
- Monadic second-order model-checking on decomposable matroids (Q548278) (← links)
- Compact labelings for efficient first-order model-checking (Q626458) (← links)
- Fast evaluation of interlace polynomials on graphs of bounded treewidth (Q634679) (← links)
- Rank-width and tree-width of \(H\)-minor-free graphs (Q709231) (← links)
- Boolean-width of graphs (Q719257) (← links)
- Well-quasi-ordering versus clique-width: new results on bigenic classes (Q722586) (← links)
- Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity (Q724225) (← links)
- Recurrence relations for graph polynomials on bi-iterative families of graphs (Q740263) (← links)
- Unavoidable vertex-minors in large prime graphs (Q740266) (← links)
- Excluded vertex-minors for graphs of linear rank-width at most \(k\) (Q740279) (← links)
- Characterizations for co-graphs defined by restricted NLC-width or clique-width operations (Q819817) (← links)
- Solving problems on generalized convex graphs via mim-width (Q832860) (← links)
- Vertex-minors, monadic second-order logic, and a conjecture by Seese (Q858683) (← links)
- MSOL partitioning problems on graphs of bounded treewidth and clique-width (Q884481) (← links)
- Are there any good digraph width measures? (Q896003) (← links)
- Meta-kernelization with structural parameters (Q896025) (← links)
- Bichain graphs: geometric model and universal graphs (Q896651) (← links)
- Directed NLC-width (Q906393) (← links)
- Digraph measures: Kelly decompositions, games, and orderings (Q930893) (← links)
- Recent developments on graphs of bounded clique-width (Q967317) (← links)
- \(H\)-join decomposable graphs and algorithms with runtime single exponential in rankwidth (Q972341) (← links)
- On a disparity between relative cliquewidth and relative NLC-width (Q972344) (← 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)
- A little statistical mechanics for the graph theorist (Q973134) (← links)
- Computing rank-width exactly (Q989474) (← links)
- Clique-width of graphs defined by one-vertex extensions (Q998353) (← links)
- Graph operations characterizing rank-width (Q1028455) (← links)
- Complexity of \(k\)-tuple total and total \(\{k\}\)-dominations for some subclasses of bipartite graphs (Q1653049) (← links)
