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...

وصف كامل

التفاصيل البيبلوغرافية
الحاوية / القاعدة:Algorithms
المؤلف الرئيسي: Miklos Molnar
التنسيق: مقال
اللغة:الإنجليزية
منشور في: MDPI AG 2024-10-01
الموضوعات:
graph theory
degree constrained spanning trees
spanning hierarchies
homomorphism
NP-hard problem
exact computation
الوصول للمادة أونلاين:https://www.mdpi.com/1999-4893/17/10/467

الانترنت

https://www.mdpi.com/1999-4893/17/10/467

مواد مشابهة