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.
- Latency-bounded target set selection in social networks (Q2447759) (← links)
- Faster algorithms for vertex partitioning problems parameterized by clique-width (Q2447760) (← links)
- Finding a minimum path cover of a distance-hereditary graph in polynomial time (Q2457005) (← links)
- Line graphs of bounded clique-width (Q2461201) (← links)
- NP-hard graph problems and boundary classes of graphs (Q2465640) (← links)
- Equistable distance-hereditary graphs (Q2473043) (← links)
- Branch-width, parse trees, and monadic second-order logic for matroids. (Q2490835) (← links)
- The monadic second-order logic of graphs. XV: On a conjecture by D. Seese (Q2494727) (← links)
- Approximating clique-width and branch-width (Q2496203) (← links)
- Recognizability, hypergraph operations, and logical types (Q2496296) (← links)
- Linear layouts measuring neighbourhoods in graphs (Q2502893) (← links)
- Vertex disjoint paths on clique-width bounded graphs (Q2503296) (← links)
- Graph partitions with prescribed patterns (Q2509761) (← links)
- Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs (Q2566023) (← links)
- The recognizability of sets of graphs is a robust property (Q2566292) (← links)
- Computing maximum stable sets for distance-hereditary graphs (Q2568337) (← links)
- On the relationship between NLC-width and linear NLC-width (Q2576869) (← links)
- Quantified conjunctive queries on partially ordered sets (Q2634671) (← links)
- The relative clique-width of a graph (Q2642017) (← links)
- The power of cut-based parameters for computing edge-disjoint paths (Q2659778) (← links)
- Triple Roman domination in graphs (Q2661014) (← links)
- Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs (Q2661217) (← links)
- Finding a maximum minimal separator: graph classes and fixed-parameter tractability (Q2661784) (← links)
- Computing the largest bond and the maximum connected cut of a graph (Q2663713) (← links)
- Unique key Horn functions (Q2672584) (← links)
- On the computational complexity of the bipartizing matching problem (Q2675722) (← links)
- Computing densest \(k\)-subgraph with structural parameters (Q2680362) (← links)
- Parameterized complexity of envy-free resource allocation in social networks (Q2680801) (← links)
- Domination and convexity problems in the target set selection model (Q2689641) (← links)
- On algorithmic applications of sim-width and mim-width of \((H_1,H_2)\)-free graphs (Q2697441) (← links)
- Perfectly matched sets in graphs: parameterized and exact computation (Q2697539) (← links)
- Bounding Clique-Width via Perfect Graphs (Q2799217) (← links)
- A Boundary Property for Upper Domination (Q2819507) (← links)
- Upper Domination: Complexity and Approximation (Q2819508) (← links)
- Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes (Q2819509) (← links)
- Well-quasi-ordering Does Not Imply Bounded Clique-width (Q2827822) (← links)
- A Slice Theoretic Approach for Embedding Problems on Digraphs (Q2827823) (← links)
- The exact weighted independent set problem in perfect graphs and related classes (Q2840556) (← links)
- Edge identifying codes (Q2857369) (← links)
- On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal (Q2891343) (← links)
- Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width (Q2891349) (← links)
- Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics (Q2891355) (← links)
- Rank-width of random graphs (Q2897211) (← links)
- Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
- Clique-perfectness and balancedness of some graph classes (Q2931952) (← links)
- Between Treewidth and Clique-Width (Q2945207) (← links)
- Quantified Conjunctive Queries on Partially Ordered Sets (Q2946013) (← links)
- Bounding the Clique-Width of H-free Chordal Graphs (Q2946383) (← links)
- A SAT Approach to Clique-Width (Q2946763) (← links)
- Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs (Q2947018) (← links)
