Degree-Constrained Minimum Spanning Hierarchies in Graphs
The minimum spanning tree problem in graphs under budget-type degree constraints (DCMST) is a well-known NP-hard problem. Spanning trees do not always exist, and the optimum can not be approximated within a constant factor. Recently, solutions have been proposed to solve degree-constrained spanning...
I tiakina i:
| Kaituhi matua: | |
|---|---|
| Hōputu: | Artigo |
| Reo: | Inglês |
| I whakaputaina: |
MDPI AG
2024-10-01
|
| Rangatū: | Algorithms |
| Ngā marau: | |
| Urunga tuihono: | https://www.mdpi.com/1999-4893/17/10/467 |
| Ngā Tūtohu: |
Kāore He Tūtohu, Me noho koe te mea tuatahi ki te tūtohu i tēnei pūkete!
|