Vertex-connectivity for node failure identification in Boolean Network Tomography

IF 0.7 4区计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS

Information Processing Letters Pub Date : 2023-10-10 DOI:10.1016/j.ipl.2023.106450

Nicola Galesi , Fariba Ranjbar , Michele Zito

引用次数: 0

Abstract

We study the node failure identification problem in undirected graphs by means of Boolean Network Tomography. We argue that vertex-connectivity plays a central role. We prove bounds on the maximum number of simultaneous node failures that can be identified in arbitrary networks. We argue that (augmented) grids are a class of networks with large failure identifiability, and provide very tight results in this context.

查看原文本刊更多论文

布尔网络层析成像中用于节点故障识别的顶点连通性

利用布尔网络层析成像方法研究了无向图中的节点故障识别问题。我们认为顶点连通性起着核心作用。我们证明了在任意网络中可以识别的同时节点故障的最大数量的界限。我们认为（增广）网格是一类具有较大故障可识别性的网络，并在这种情况下提供了非常严密的结果。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Information Processing Letters 工程技术-计算机：信息系统

CiteScore

1.80

自引率

0.00%

发文量

审稿时长

7.3 months

期刊介绍： Information Processing Letters invites submission of original research articles that focus on fundamental aspects of information processing and computing. This naturally includes work in the broadly understood field of theoretical computer science; although papers in all areas of scientific inquiry will be given consideration, provided that they describe research contributions credibly motivated by applications to computing and involve rigorous methodology. High quality experimental papers that address topics of sufficiently broad interest may also be considered. Since its inception in 1971, Information Processing Letters has served as a forum for timely dissemination of short, concise and focused research contributions. Continuing with this tradition, and to expedite the reviewing process, manuscripts are generally limited in length to nine pages when they appear in print.