Pages that link to "Item:Q1167739"
From MaRDI portal
The following pages link to Another look at the degree constrained subgraph problem (Q1167739):
Displayed 13 items.
- On the approximability of some degree-constrained subgraph problems (Q444431) (← links)
- Influence of assortativity and degree-preserving rewiring on the spectra of networks (Q614567) (← links)
- Linear-time certifying algorithms for near-graphical sequences (Q1045061) (← links)
- Distributed backup placement in networks (Q1741963) (← links)
- Assigning papers to referees (Q1959732) (← links)
- Computing a consensus trajectory in a vehicular network (Q2091112) (← links)
- A \(\frac{4}{3}\)-approximation algorithm for the maximum internal spanning tree problem (Q2656175) (← links)
- Using Parametric Transformations Toward Polynomial Kernels for Packing Problems Allowing Overlaps (Q2828236) (← links)
- Degree-Constrained Subgraph Reconfiguration is in P (Q2946420) (← links)
- Kernelization Algorithms for Packing Problems Allowing Overlaps (Q2948487) (← links)
- Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems (Q2971609) (← links)
- Packings by Complete Bipartite Graphs (Q3728943) (← links)
- A Polynomial Time Algorithm for Finding a Spanning Tree with Maximum Number of Internal Vertices on Interval Graphs (Q4632175) (← links)