Pages that link to "Item:Q958203"
From MaRDI portal
The following pages link to Solving connected dominating set faster than \(2^n\) (Q958203):
Displaying 37 items.
- Searching for a cycle with maximum coverage in undirected graphs (Q331987) (← links)
- Max-leaves spanning tree is APX-hard for cubic graphs (Q414465) (← links)
- An exact exponential-time algorithm for the directed maximum leaf spanning tree problem (Q450578) (← links)
- A linear kernel for a planar connected dominating set (Q534569) (← links)
- An exact algorithm for connected red-blue dominating set (Q635737) (← links)
- On partitioning a graph into two connected subgraphs (Q650911) (← links)
- A new algorithm for finding trees with many leaves (Q652536) (← links)
- An exact algorithm for the maximum leaf spanning tree problem (Q653320) (← links)
- On parameterized independent feedback vertex set (Q690464) (← links)
- FPT algorithms for connected feedback vertex set (Q695322) (← links)
- FPT algorithms and kernels for the directed \(k\)-leaf problem (Q847265) (← links)
- Partitioning graphs into connected parts (Q1034603) (← links)
- Computational approaches for zero forcing and related problems (Q1631510) (← links)
- Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree} (Q1939668) (← links)
- Complexity and computation of connected zero forcing (Q2012050) (← links)
- Inclusion/exclusion meets measure and conquer (Q2249747) (← links)
- Constructing a spanning tree with many leaves (Q2256702) (← links)
- Layered graphs: applications and algorithms (Q2287476) (← links)
- On connected dominating sets of restricted diameter (Q2356248) (← links)
- Computing optimal Steiner trees in polynomial space (Q2392926) (← links)
- Connected power domination in graphs (Q2424811) (← links)
- An exact exponential time algorithm for \textsc{Power} \textsc{Dominating} \textsc{Set} (Q2429350) (← links)
- Sharp separation and applications to exact and parameterized algorithms (Q2429363) (← links)
- Solving Capacitated Dominating Set by using covering by subsets and maximum matching (Q2442208) (← links)
- Computing the differential of a graph: hardness, approximability and exact algorithms (Q2448922) (← links)
- Solving target set selection with bounded thresholds faster than \(2^n\) (Q2684482) (← links)
- Domination and its variants in split graphs \(-\text{P}\) versus NPC dichotomy (Q2692638) (← links)
- Near-Optimal Dominating Sets via Random Sampling (Q2830067) (← links)
- Partitioning Graphs into Connected Parts (Q3392949) (← links)
- On Finding Directed Trees with Many Leaves (Q3656853) (← links)
- Below All Subsets for Minimal Connected Dominating Set (Q4683902) (← links)
- Efficient Local Search based on Dynamic Connectivity Maintenance for Minimum Connected Dominating Set (Q4989343) (← links)
- Solving Target Set Selection with Bounded Thresholds Faster than 2^n (Q5009485) (← links)
- Robust Connectivity of Graphs on Surfaces (Q5084099) (← links)
- Computing Minimum <i>k</i>-Connected <i>m</i>-Fold Dominating Set in General Graphs (Q5131721) (← links)
- Breaking the <i>O</i>(ln <i>n</i>) Barrier: An Enhanced Approximation Algorithm for Fault-Tolerant Minimum Weight Connected Dominating Set (Q5131722) (← links)
- Linear separation of connected dominating sets in graphs (Q5225055) (← links)
