The complexity of the overlay network verification and its related problems
© 2014 IEEE. In this paper we introduce a special type of virtual networks called an overlay network. We first study a decision problem called the OVERLAY NETWORK VERIFICATION PROBLEM and show that this problem is NP-complete. We then place some restriction to the original problem and prove that the...
محفوظ في:
المؤلفون الرئيسيون: | Wattana Jindaluang, Sanpawat Kantabutra, Varin Chouvatut |
---|---|
التنسيق: | وقائع المؤتمر |
منشور في: |
2018
|
الموضوعات: | |
الوصول للمادة أونلاين: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84942856816&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/53416 |
الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
مواد مشابهة
-
The complexity of the overlay network verification and its related problems
بواسطة: Wattana Jindaluang, وآخرون
منشور في: (2018) -
Under-sampling by algorithm with performance guaranteed for class-imbalance problem
بواسطة: Wattana Jindaluang, وآخرون
منشور في: (2018) -
An improved approximation algorithm for the s-t path movement problem
بواسطة: Wattana Jindaluang, وآخرون
منشور في: (2018) -
Under-sampling by algorithm with performance guaranteed for class-imbalance problem
بواسطة: Wattana Jindaluang, وآخرون
منشور في: (2018) -
An improved approximation algorithm for the s-t path movement problem
بواسطة: Wattana Jindaluang, وآخرون
منشور في: (2018)