A problem of finding the maximal spanning connected subgraph with given vertex degrees.
From MaRDI portal
Recommendations
- A certain generalization of the maximum traveling salesman problem
- Polynomial algorithms for some hard problems of finding connected spanning subgraphs of extreme total edge weight
- scientific article; zbMATH DE number 1563034
- Degree-Constrained Subgraph Problems: Hardness and Approximation Results
- scientific article; zbMATH DE number 742978
Cited in
(10)- Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming
- A certain generalization of the maximum traveling salesman problem
- An approximate algorithm for finding a maximum-weight d-homogeneous connected spanning subgraph in a complete graph with random edge weights
- On the approximability of some degree-constrained subgraph problems
- scientific article; zbMATH DE number 1563034 (Why is no real title available?)
- On the connected spanning cubic subgraph problem
- Polynomial algorithms for some hard problems of finding connected spanning subgraphs of extreme total edge weight
- Maximum series-parallel subgraph
- On the complexity of some subgraph problems
- An ILP formulation and genetic algorithm for the maximum degree-bounded connected subgraph problem
This page was built for publication: A problem of finding the maximal spanning connected subgraph with given vertex degrees.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4789854)