Fractional Matching Preclusion for Data Center Networks

期刊： PARALLEL PROCESSING LETTERS, 2021; 31 (3)

An edge subset F of G is a fractional matching preclusion set (FMP set for short) if G - F has no fractional perfect matchings. The fractional matchin......

On the Versatility of Bracha's Byzantine Reliable Broadcast Algorithm

期刊： PARALLEL PROCESSING LETTERS, 2021; 31 (3)

G. Bracha presented in 1987 a simple and efficient reliable broadcast algorithm for n-process asynchronous message-passing systems, which tolerates up......

Contractible Edges in 3-Connected Cubic Graphs

期刊： PARALLEL PROCESSING LETTERS, 2021; 31 (3)

An edge e in a 3-connected graph G is contractible if the contraction G/e is still 3-connected. Let E-C(G) be the set of contractible edges of G, N-G(......

Adaptive Diagnosis of Hamiltonian Networks under the Comparison Model

期刊： PARALLEL PROCESSING LETTERS, 2021; 31 (3)

Adaptive diagnosis is an approach in which tests can be scheduled dynamically during the diagnosis process based on the previous test outcomes. Natura......

Reliability Evaluation of Generalized Exchanged Hypercubes Based on Imprecise Diagnosis Strategies

期刊： PARALLEL PROCESSING LETTERS, 2021; 31 (1)

Fault diagnostic analysis is extremely important for interconnection networks. The t'/g-diagnosis imprecise strategy plays an essential role in the re......

Fractional Strong Matching Preclusion for DHcube

期刊： PARALLEL PROCESSING LETTERS, 2021; 31 (1)

Let F be a set edges and F' be a set of edges and/or vertices of a graph G, then F (resp. F') is a fractional matching preclusion set (resp. fractiona......