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 41 items.
- Node multiway cut and subset feedback vertex set on graphs of bounded mim-width (Q5970812) (← links)
- On the outer independent total double Roman domination in graphs (Q6042155) (← links)
- A polynomial kernel for 3-leaf power deletion (Q6046945) (← links)
- Fair allocation algorithms for indivisible items under structured conflict constraints (Q6056608) (← links)
- Clique‐width: Harnessing the power of atoms (Q6062871) (← links)
- In)approximability of Maximum Minimal FVS (Q6065391) (← links)
- Contracting to a longest path in H-free graphs (Q6065420) (← links)
- A Framework for Minimal Hereditary Classes of Graphs of Unbounded Clique-Width (Q6069433) (← links)
- A class of graphs with large rankwidth (Q6080165) (← links)
- THE MINIMAL DOMINATING SETS IN A DIRECTED GRAPH AND THE KEY INDICATORS SET OF SOCIO–ECONOMIC SYSTEM (Q6081707) (← links)
- Linear‐time algorithms for eliminating claws in graphs (Q6082274) (← links)
- Parameterized Complexity of Geodetic Set (Q6089667) (← links)
- Parameterized Complexity of Graph Burning (Q6089668) (← links)
- (Q6089671) (← links)
- Solving larger maximum clique problems using parallel quantum annealing (Q6098277) (← links)
- Feferman-vaught decompositions for prefix classes of first order logic (Q6117143) (← links)
- Parameterized complexity for iterated type partitions and modular-width (Q6126724) (← links)
- Grouped domination parameterized by vertex cover, twin cover, and beyond (Q6131196) (← links)
- Treewidth versus clique number. II: Tree-independence number (Q6144406) (← links)
- Stability, vertex stability, and unfrozenness for special graph classes (Q6151148) (← links)
- Extended MSO model checking via small vertex integrity (Q6185940) (← links)
- Some new algorithmic results on co-secure domination in graphs (Q6190005) (← links)
- Three remarks on \(\mathbf{W}_{\mathbf{2}}\) graphs (Q6201337) (← links)
- Compact Distributed Interactive Proofs for the Recognition of Cographs and Distance-Hereditary Graphs (Q6488452) (← links)
- Complexity of the (Connected) Cluster Vertex Deletion Problem on H-free Graphs (Q6489319) (← links)
- Succinct data structures for bounded clique-width graphs (Q6497944) (← links)
- Induced tree covering and the generalized Yutsis property (Q6547951) (← links)
- Slim tree-cut width (Q6586668) (← links)
- Polynomial Turing compressions for some graph problems parameterized by modular-width (Q6591463) (← links)
- How I got to like graph polynomials (Q6593617) (← links)
- Fast FPT-approximation of branchwidth (Q6593764) (← links)
- Perfect Italian domination on some generalizations of cographs (Q6616154) (← links)
- Fixed-parameter algorithms for computing RAC drawings of graphs (Q6618251) (← links)
- Algorithmic meta-theorems for combinatorial reconfiguration revisited (Q6623591) (← links)
- Twin-width. III: Max independent set, min dominating set, and coloring (Q6631356) (← links)
- On the proper interval completion problem within some chordal subclasses (Q6635117) (← links)
- Fixed-parameter algorithms for computing bend-restricted RAC drawings of graphs (Q6636993) (← links)
- Stable graphs of bounded twin-width (Q6649471) (← links)
- Model checking on interpretations of classes of bounded local cliquewidth (Q6649489) (← links)
- Structural parameterizations of vertex integrity (Q6652467) (← links)
- Exact and parameterized algorithms for the independent cutset problem (Q6655670) (← links)
