Pages that link to "Item:Q3602827"
From MaRDI portal
The following pages link to Degree-Constrained Subgraph Problems: Hardness and Approximation Results (Q3602827):
Displaying 15 items.
- On dynamic monopolies of graphs with general thresholds (Q409449) (← links)
- Parameterized complexity of finding small degree-constrained subgraphs (Q414424) (← links)
- On the approximability of some degree-constrained subgraph problems (Q444431) (← links)
- On the complexity of making a distinguished vertex minimum or maximum degree by vertex deletion (Q491619) (← links)
- An ILP formulation and genetic algorithm for the maximum degree-bounded connected subgraph problem (Q988336) (← links)
- Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs (Q988694) (← links)
- The maximum binary tree problem (Q2041978) (← links)
- The maximum degree \& diameter-bounded subgraph and its applications (Q2392540) (← links)
- Parameterized domination in circle graphs (Q2441539) (← links)
- Degree constrained subgraphs (Q2482112) (← links)
- Subexponential parameterized algorithms for bounded-degree connected subgraph problems on planar graphs (Q2839212) (← links)
- Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width (Q2891349) (← links)
- On Approximating the d-Girth of a Graph (Q3075539) (← links)
- Degree-Constrained Subgraph Problems: Hardness and Approximation Results (Q3602827) (← links)
- The Maximum Binary Tree Problem. (Q5874498) (← links)