๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A Linear Time Algorithm for Sequential Diagnosis in Hypercubes

โœ Scribed by S. Khanna; W.K. Fuchs

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
520 KB
Volume
26
Category
Article
ISSN
0743-7315

No coin nor oath required. For personal study only.

โœฆ Synopsis

This paper describes a new sequential diagnosis algorithm for hypercubes. The algorithm is based on the PMC model and it assumes the existence of a central observer for syndrome decoding. If we denote the total number of processors in a given hypercube by (N), then the algorithm achieves (\theta(\sqrt{N \log N})) degree of diagnosability using only (O(N)) tests over all iterations of diagnosis and repair. The aggregated syndrome decoding time is also shown to be (O(N)) for this algorithm. The number of iterations of diagnosis and repair needed by the algorithm is (O(\log N) .01995) Academic Press, Inc.

๐Ÿ“œ SIMILAR VOLUMES

A linear-time algorithm for broadcast do
A linear-time algorithm for broadcast domination in a tree
โœ John Dabney; Brian C. Dean; Stephen T. Hedetniemi ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 268 KB

## Abstract The broadcast domination problem is a variant of the classical minimum dominating set problem in which a transmitter of power __p__ at vertex __v__ is capable of dominating (broadcasting to) all vertices within distance __p__ from __v__. Our goal is to assign a broadcast power __f__(__v

A Linear Time Algorithm for Finding ak-T
A Linear Time Algorithm for Finding ak-Tree Core
โœ Akiyoshi Shioura; Takeaki Uno ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 173 KB

Given a tree containing n vertices, consider the sum of the distance between all ลฝ . vertices and a k-leaf subtree subtree which contains exactly k leaves . A k-tree core is a k-leaf subtree which minimizes the sum of the distances. In this paper, we propose a linear time algorithm for finding a k-t

A linear time algorithm for edge colorin
A linear time algorithm for edge coloring of binomial trees
โœ M. Kubale; K. Piwakowski ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 448 KB

We consider the problem of efficient coloring of the edges of a so-called binomial tree T, i.e. acyclic graph containing two kinds of edges: those which must have a single color and those which are to be colored with L consecutive colors, where L is an arbitrary integer greater than 1. We give an O(

A Simple Linear Time Algorithm for Trian
A Simple Linear Time Algorithm for Triangulating Three-Colored Graphs
โœ H. Bodlaender; T. Kloks ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 560 KB

In this paper we consider the problem of determining whether a given colored graph can be triangulated, such that no edges between vertices of the same color are added. This problem originated from the perfect phylogeny problem from molecular biology and is strongly related with the problem of recog