当前位置: X-MOL 学术Numer. Methods Partial Differ. Equ. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Computing the weighted neighbor isolated tenacity of interval graphs in polynomial time
Numerical Methods for Partial Differential Equations ( IF 3.9 ) Pub Date : 2020-12-29 , DOI: 10.1002/num.22736
Ersin Aslan 1 , Mehmet A. Tosun 2
Affiliation  

Weighted graphs in graph theory are created by weighing different values depending on the importance of connections or centers in a graph model. Networks can be modeled with graphs such that the devices and centers correspond to the vertices and connections correspond to the edges. In these networks, weight can be assigned to the vertices for the workload and importance of the devices and centers, so that planning such as security and cost can be made in advance in the design of the network. Network reliability and security is an important issue in the computing area. There are several parameters for vulnerability measurement values of these networks modeled with graphs. We recommend the weighted conversion of the neighbor isolated tenacity parameter for this topic. It is known that tenacity, which is the basis of this parameter, is NP‐hard. But polynomial solutions can be created in interval graphs, which is a special graph from the perfect graph class. In this article, polynomial time algorithm is given to calculate weighted neighbor isolated tenacity of the interval graphs.

中文翻译:

计算多项式时间内间隔图的加权邻居孤立强度

图论中的加权图是根据图模型中连接或中心的重要性通过加权不同的值来创建的。可以使用图形对网络进行建模,以使设备和中心对应于顶点,连接对应于边。在这些网络中,可以为设备和中心的工作量和重要性分配顶点的权重,以便可以在网络设计中预先进行诸如安全性和成本之类的规划。网络可靠性和安全性是计算领域中的重要问题。使用图形建模的这些网络的漏洞度量值有几个参数。对于此主题,我们建议对邻居隔离强度参数进行加权转换。众所周知,作为此参数基础的坚韧是NP-hard。但是可以在区间图中创建多项式解,区间图是来自完美图类的特殊图。本文给出了多项式时间算法来计算区间图的加权邻居孤立强度。
更新日期:2020-12-29
down
wechat
bug