Pages that link to "Item:Q444431"
From MaRDI portal
The following pages link to On the approximability of some degree-constrained subgraph problems (Q444431):
Displaying 9 items.
- Tight complexity bounds for FPT subgraph problems parameterized by the clique-width (Q388791) (← links)
- On robust clusters of minimum cardinality in networks (Q513606) (← links)
- Distributed backup placement in networks (Q1741963) (← links)
- On approximating the \(d\)-girth of a graph (Q2444552) (← links)
- Degree constrained subgraphs (Q2482112) (← links)
- Degree-Constrained Subgraph Problems: Hardness and Approximation Results (Q3602827) (← links)
- Minimum <i>k</i>‐cores and the <i>k</i>‐core polytope (Q6087566) (← links)
- Effective and efficient community search with size constraint on bipartite graphs (Q6095648) (← links)
- Target set in threshold models (Q6621268) (← links)
