Pages that link to "Item:Q3503575"
From MaRDI portal
The following pages link to Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem (Q3503575):
Displaying 16 items.
- Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems (Q392025) (← links)
- Parameterized complexity of connected even/odd subgraph problems (Q395000) (← links)
- Parameterized complexity of three edge contraction problems with degree constraints (Q471188) (← links)
- The minimum spanning strong subdigraph problem is fixed parameter tractable (Q1005234) (← links)
- Multiple hypernode hitting sets and smallest two-cores with targets (Q1041434) (← links)
- The maximum binary tree problem (Q2041978) (← links)
- An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems (Q2354725) (← links)
- Parameterized Complexity of Two Edge Contraction Problems with Degree Constraints (Q2867069) (← links)
- Multi-parameter Complexity Analysis for Constrained Size Graph Problems: Using Greediness for Parameterization (Q2867073) (← links)
- Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width (Q2891349) (← links)
- Parameterized Complexity of the Sparsest k-Subgraph Problem in Chordal Graphs (Q2938098) (← links)
- On Approximating the d-Girth of a Graph (Q3075539) (← links)
- Degree-Constrained Subgraph Problems: Hardness and Approximation Results (Q3602827) (← links)
- Multiple Hypernode Hitting Sets and Smallest Two-Cores with Targets (Q5505641) (← links)
- The Maximum Binary Tree Problem. (Q5874498) (← links)
- Immune sets in monotone infection rules. Characterization and complexity (Q6064851) (← links)
