The complexity of the overlay network verification and its related problems

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

Saved in:

書目詳細資料
Main Authors:	Wattana Jindaluang, Sanpawat Kantabutra, Varin Chouvatut
格式:	Conference Proceeding
出版:	2018
主題:	Computer Science Mathematics Medicine
在線閱讀:	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, et al.
出版: (2018)

Under-sampling by algorithm with performance guaranteed for class-imbalance problem
由: Wattana Jindaluang, et al.
出版: (2018)

An improved approximation algorithm for the s-t path movement problem
由: Wattana Jindaluang, et al.
出版: (2018)

Under-sampling by algorithm with performance guaranteed for class-imbalance problem
由: Wattana Jindaluang, et al.
出版: (2018)

An improved approximation algorithm for the s-t path movement problem
由: Wattana Jindaluang, et al.
出版: (2018)

Polynomial-time algorithms for path movement problems on trees and unicyclic graphs
由: Varin Chouvatut, et al.
出版: (2020)

It's elementary, my dear watson: Time-optimal sorting algorithms on a completely overlapping network
由: Sanpawat Kantabutra, et al.
出版: (2018)

Training set size reduction in large dataset problems
由: Varin Chouvatut, et al.
出版: (2018)

An Improved Approximation Algorithm for the s-t Path Movement Problem
由: Wattana Jindaluang, et al.
出版: (2019)

Virtual piano with real-time interaction using automatic marker detection
由: Varin Chouvatut, et al.
出版: (2018)

The parallel complexities of the K-medians related problems
由: Sirion Vittayakorn, et al.
出版: (2018)

The Complexity of the Infinity Replacement Problem in the Cyber Security Model
由: Supachai Mukdasanit, et al.
出版: (2018)

The complexity of cyber attacks in a new layered-security model and the maximum-weight, rooted-subtree problem
由: Geir Agnarsson, et al.
出版: (2018)

The flexible and adaptive X-mark detection for the simple answer sheets
由: Varin Chouvatut, et al.
出版: (2018)

Maximum coverage of radius-one sources in the wireless communication
由: Pattama Longani, et al.
出版: (2018)

On cyber attacks and the maximum-weight rooted-subtree problem
由: Geir Agnarsson, et al.
出版: (2018)

Efficiency comparisons between k-centers and k-means algorithms
由: Varin Chouvatut, et al.
出版: (2018)

A mobility model for studying wireless communication and the complexity of problems in the model
由: Raymond Greenlaw, et al.
出版: (2018)

Virtual piano with real-time interaction using automatic marker detection
由: Varin Chouvatut, et al.
出版: (2018)

The graph relabeling problem and its variants
由: Geir Agnarsson, et al.
出版: (2018)

Fast and efficient parallel coarsest refinement
由: Nopadon Juneam, et al.
出版: (2018)

The complexity of the grid wireless mobility model
由: Sanpawat Kantabutra, et al.
出版: (2018)

Vocabulary practicing from assisting techniques in three dimensional animation with user interaction
由: Kornprom Pikulkaew, et al.
出版: (2019)

On the parallel complexity of minimum sum of diameters clustering
由: Nopadon Juneam, et al.
出版: (2018)

The complexity of the evolution of GRAPH LABELINGS
由: Geir Agnarsson, et al.
出版: (2018)

On the parallel complexity of hierarchical clustering and CC-complete problems
由: Raymond Greenlaw, et al.
出版: (2018)

Pattern extraction from northern Thai fabrics using flexibly matching segments: Sarong Teenjok and Lanna textiles
由: Nattha Vasantapan, et al.
出版: (2018)

The structure of rooted weighted trees modeling layered cyber-security systems
由: Geir Agnarsson, et al.
出版: (2018)

Numerical verification of certain oscillation result on time scales
由: Wichuta Sae-Jie, et al.
出版: (2018)

Overlaying procedures
由: Fernando, Purisima B.
出版: (2005)

Fast and efficient parallel coarsest refinement
由: Nopadon Juneam, et al.
出版: (2018)

The complexity of cyber attacks in a new layered-security model and the maximum-weight, rooted-subtree problem
由: Geir Agnarsson, et al.
出版: (2018)

Dataflow optimized overlays for FPGAs
由: Siddhartha
出版: (2019)

First principles calculation on bonding of PT-Fe overlayer and its effects on PT-surface reactivity
由: Escaño, Mary Clare Sison
出版: (2008)

Merging ring-structured overlay indices : toward network-data transparency
由: Datta, Anwitaman
出版: (2013)

VENO2 : a generic overlay infrastructure over heterogeneous networks
由: Yu, Kuan
出版: (2010)

Time complexity of the edge replacement problem in a cyber security system
由: Supachai Mukdasanit
出版: (2019)

Generalized self-adaptive algorithm for solving split common fixed point problem and its application to image restoration problem
由: Raweerote Suparatulatorn, et al.
出版: (2019)

An improved approximation algorithm for the s-t path movement problem
由: Jindaluang W., et al.
出版: (2017)

Graphical representation of the whole sequentially MRI images in a single view image sequences of human's whole head
由: Varin Chouvatut, et al.
出版: (2018)