Pages that link to "Item:Q1974445"
From MaRDI portal
The following pages link to Linear time solvable optimization problems on graphs of bounded clique-width (Q1974445):
Displaying 50 items.
- Regular independent sets (Q260019) (← links)
- An algorithmic metatheorem for directed treewidth (Q266806) (← links)
- Clique-width of path powers (Q266933) (← links)
- Clique cycle-transversals in distance-hereditary graphs (Q299045) (← links)
- Between treewidth and clique-width (Q300479) (← links)
- Fly-automata for checking monadic second-order properties of graphs of bounded tree-width (Q324700) (← links)
- Some links between identifying codes and separating, dominating and total dominating sets in graphs (Q324774) (← links)
- A complexity dichotomy and a new boundary class for the dominating set problem (Q328713) (← links)
- Model counting for CNF formulas of bounded modular treewidth (Q334935) (← links)
- The VC-dimension of graphs with respect to \(k\)-connected subgraphs (Q335348) (← 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)
- Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems (Q392025) (← links)
- Lower bounds on the complexity of \(\mathsf{MSO}_1\) model-checking (Q395003) (← links)
- Courcelle's theorem -- a game-theoretic approach (Q408375) (← links)
- Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences (Q412344) (← links)
- Graphs of separability at most 2 (Q415268) (← links)
- Parameterized complexity of generalized domination problems (Q415279) (← 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)
- Determining the chromatic number of triangle-free \(2P_3\)-free graphs in polynomial time (Q417995) (← links)
- The complexity of finding uniform sparsest cuts in various graph classes (Q450559) (← links)
- Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number (Q450563) (← 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)
- Dominating induced matchings for \(P_7\)-free graphs in linear time (Q476446) (← links)
- Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs (Q477653) (← links)
- On the complexity of the minimum domination problem restricted by forbidden induced subgraphs of small size (Q499360) (← links)
- A new graph construction of unbounded clique-width (Q509276) (← links)
- Critical hereditary graph classes: a survey (Q518125) (← links)
- The behavior of clique-width under graph operations and graph transformations (Q519907) (← links)
- Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
- Compact labelings for efficient first-order model-checking (Q626458) (← links)
- Minimal classes of graphs of unbounded clique-width (Q659655) (← links)
- On the complexity of the dominating induced matching problem in hereditary classes of graphs (Q716179) (← links)
- Boolean-width of graphs (Q719257) (← links)
- Graphs of linear clique-width at most 3 (Q719287) (← links)
- Upper domination: towards a dichotomy through boundary properties (Q722525) (← links)
- Well-quasi-ordering versus clique-width: new results on bigenic classes (Q722586) (← links)
- Compact representation of graphs of small clique-width (Q724221) (← 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)
- Algorithms for unipolar and generalized split graphs (Q741738) (← links)
- Mind the independence gap (Q776261) (← links)
- Grundy dominating sequences on \(X\)-join product (Q777371) (← links)
- Parameterized leaf power recognition via embedding into graph products (Q786044) (← links)
- On algorithms for (\(P_5\), gem)-free graphs (Q817767) (← links)
- Characterizations for co-graphs defined by restricted NLC-width or clique-width operations (Q819817) (← links)
- Trees, grids, and MSO decidability: from graphs to matroids (Q820150) (← links)
