Pages that link to "Item:Q1874418"
From MaRDI portal
The following pages link to Algorithms for vertex-partitioning problems on graphs with fixed clique-width. (Q1874418):
Displaying 31 items.
- Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems (Q392025) (← links)
- Graphs of separability at most 2 (Q415268) (← links)
- Polynomial-time recognition of clique-width \(\leq 3\) graphs (Q415285) (← links)
- The balanced satisfactory partition problem (Q831826) (← links)
- MSOL partitioning problems on graphs of bounded treewidth and clique-width (Q884481) (← links)
- Graph classes with and without powers of bounded clique-width (Q896650) (← links)
- Min-max communities in graphs: complexity and computational properties (Q899313) (← links)
- Directed NLC-width (Q906393) (← links)
- \(H\)-join decomposable graphs and algorithms with runtime single exponential in rankwidth (Q972341) (← links)
- On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width (Q972346) (← links)
- Satisfactory graph partition, variants, and generalizations (Q976309) (← links)
- A branch-and-price-and-cut method for computing an optimal bramble (Q1751138) (← links)
- Not-all-equal and 1-in-degree decompositions: algorithmic complexity and applications (Q1799219) (← links)
- Edge dominating set and colorings on graphs with fixed clique-width (Q1861574) (← links)
- Cluster deletion on interval graphs and split related graphs (Q2037103) (← links)
- A note on the satisfactory partition problem: constant size requirement (Q2094373) (← links)
- Star colouring of bounded degree graphs and regular graphs (Q2124639) (← links)
- Asymptotically almost every \(2r\)-regular graph has an internal partition (Q2303426) (← links)
- Degree-constrained decompositions of graphs: Bounded treewidth and planarity (Q2369007) (← links)
- Latency-bounded target set selection in social networks (Q2447759) (← links)
- The satisfactory partition problem (Q2495904) (← links)
- Graphs of Separability at Most Two: Structural Characterizations and Their Consequences (Q3000517) (← links)
- On the Boolean-Width of a Graph: Structure and Applications (Q3057622) (← links)
- (Q4625695) (← links)
- Tree Pivot-Minors and Linear Rank-Width (Q5020842) (← links)
- (Q5092370) (← links)
- Parameterized complexity of satisfactory partition problem (Q5918491) (← links)
- Fair allocation algorithms for indivisible items under structured conflict constraints (Q6056608) (← links)
- Clique‐width: Harnessing the power of atoms (Q6062871) (← links)
- Offensive alliances in graphs (Q6201327) (← links)
- An algorithmic framework for locally constrained homomorphisms (Q6499010) (← links)
