Pages that link to "Item:Q1974445"

The following pages link to Linear time solvable optimization problems on graphs of bounded clique-width (Q1974445):

Displaying 50 items.

• On the complexity of the labeled domination problem in graphs (Q2968509) (← links)
• Linear Clique‐Width for Hereditary Classes of Cographs (Q2978187) (← links)
• Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes (Q3000488) (← links)
• Graphs of Separability at Most Two: Structural Characterizations and Their Consequences (Q3000517) (← 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)
• Colouring Vertices of Triangle-Free Graphs (Q3057624) (← links)
• Are There Any Good Digraph Width Measures? (Q3058698) (← links)
• Counting Spanning Trees in Graphs Using Modular Decomposition (Q3078398) (← links)
• Enumeration of Minimal Dominating Sets and Variants (Q3088292) (← links)
• Graph Classes with Structured Neighborhoods and Algorithmic Applications (Q3104764) (← links)
• Digraphs of Bounded Width (Q3120441) (← links)
• (Q3125666) (← links)
• The Maximum Weight Stable Set Problem in ( $$P_6$$ , bull)-Free Graphs (Q3181049) (← links)
• Parameterized (approximate) defective coloring (Q3304104) (← links)
• Colouring square-free graphs without long induced paths. (Q3304134) (← links)
• (Q3386630) (← links)
• A Framework for Exponential-Time-Hypothesis--Tight Algorithms and Lower Bounds in Geometric Intersection Graphs (Q3387760) (← links)
• Containment of Monadic Datalog Programs via Bounded Clique-Width (Q3449494) (← links)
• Solving Problems on Graphs of High Rank-Width (Q3449829) (← links)
• On the Equivalence among Problems of Bounded Width (Q3452838) (← links)
• Algorithms for Propositional Model Counting (Q3498488) (← links)
• Graphs of Linear Clique-Width at Most 3 (Q3502658) (← links)
• Graph Operations Characterizing Rank-Width and Balanced Graph Expressions (Q3508555) (← links)
• The Clique-Width of Tree-Power and Leaf-Power Graphs (Q3508556) (← links)
• THE CLIQUE-WIDTH OF BIPARTITE GRAPHS IN MONOGENIC CLASSES (Q3526986) (← links)
• Monadic Second-Order Logic for Graphs: Algorithmic and Language Theoretical Applications (Q3618564) (← links)
• The complexity of the matching-cut problem for planar graphs and other graph classes (Q3652545) (← links)
• Dominating Induced Matchings (Q3655141) (← links)
• On Digraph Width Measures in Parameterized Algorithmics (Q3656861) (← links)
• Linear time solvable optimization problems on graphs of bounded clique width (Q4232773) (← links)
• (Q4448752) (← links)
• On the structure of (pan, even hole)‐free graphs (Q4604020) (← links)
• How Bad is the Freedom to Flood-It? (Q4622773) (← links)
• (Q4625695) (← links)
• Model checking existential logic on partially ordered sets (Q4635604) (← links)
• Multi-clique-width (Q4638063) (← links)
• GETGRATS (Q4923529) (← links)
• Graph Operations, Graph Transformations and Monadic Second-Order Logic: (Q4923534) (← links)
• Secure total domination in chain graphs and cographs (Q4956172) (← links)
• Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs (Q4972678) (← links)
• (Q5002765) (← links)
• (Q5002812) (← links)
• Recovering sparse graphs (Q5005129) (← links)
• Parameterized Leaf Power Recognition via Embedding into Graph Products (Q5009478) (← links)
• (Q5009491) (← links)
• Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure (Q5013568) (← links)
• Tree Pivot-Minors and Linear Rank-Width (Q5020842) (← links)
• Iterated Type Partitions (Q5041190) (← links)