Pages that link to "Item:Q2496203"
From MaRDI portal
The following pages link to Approximating clique-width and branch-width (Q2496203):
Displayed 50 items.
- 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)
- 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)
- Characterizations for co-graphs defined by restricted NLC-width or clique-width operations (Q819817) (← 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)
- 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)
- Polynomial algorithms for protein similarity search for restricted mRNA structures (Q2380067) (← links)
- On powers of graphs of bounded NLC-width (clique-width) (Q2383546) (← links)
- Rank-width and well-quasi-ordering of skew-symmetric or symmetric matrices (Q2427899) (← links)
- Vertex-minor reductions can simulate edge contractions (Q2457014) (← links)
- Line graphs of bounded clique-width (Q2461201) (← links)
- Hypertree width and related hypergraph invariants (Q2461773) (← links)
- Solving \#SAT using vertex covers (Q2464035) (← links)
- Counting truth assignments of formulas of bounded tree-width or clique-width (Q2473047) (← links)
- Branch-width, parse trees, and monadic second-order logic for matroids. (Q2490835) (← links)
- Linear layouts measuring neighbourhoods in graphs (Q2502893) (← links)
- Vertex disjoint paths on clique-width bounded graphs (Q2503296) (← links)
- Rank-width and vertex-minors (Q2565688) (← links)
- The recognizability of sets of graphs is a robust property (Q2566292) (← links)
- The relative clique-width of a graph (Q2642017) (← links)
- Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width (Q2891349) (← links)
- Rank-width of random graphs (Q2897211) (← links)
- Complexity of Ising Polynomials (Q2911072) (← links)
- Computing the Clique-Width of Large Path Powers in Linear Time via a New Characterisation of Clique-Width (Q3007630) (← links)
- Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width (Q3010427) (← 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)
- New Results on the Complexity of the Max- and Min-Rep Problems (Q3075522) (← links)
- Graph Classes with Structured Neighborhoods and Algorithmic Applications (Q3104764) (← links)
- Simple monadic theories and partition width (Q3170562) (← links)
- Rank-width and Well-quasi-ordering of Skew-symmetric Matrices (Q3439350) (← links)
- Algorithms for Propositional Model Counting (Q3498488) (← links)