Resilience of partial  k ‐tree networks with edge and node failures | Zendy

MataMontero Erick | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Premium

Resilience of partial k ‐tree networks with edge and node failures

Author(s) -

MataMontero Erick

Publication year - 1991

Publication title -

networks

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.977

H-Index - 64

eISSN - 1097-0037

pISSN - 0028-3045

DOI - 10.1002/net.3230210305

Subject(s) - resilience (materials science) , node (physics) , tree (set theory) , computer science , enhanced data rates for gsm evolution , embedding , mathematics , combinatorics , computer network , engineering , artificial intelligence , physics , structural engineering , thermodynamics

The resilience of a network is the expected number of pairs of nodes that can communicate. Computing the resilience of a network is a #P‐complete problem even for planar networks with fail‐safe nodes. We generalize an O ( n 2 ) time algorithm to compute the resilience of n ‐node k ‐tree networks with fail‐safe nodes to obtain an O(n) time algorithm that computes the resilience of n ‐node partial k ‐tree networks with edge and node failures (given a fixed k and an embedding of the partial k ‐tree in a k ‐tree).

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here

Accelerating Research