Largest component and node fault tolerance for grids

DOI10.37236/8376zbMATH Open1459.05214OpenAlexW3136852174MaRDI QIDQ2656897FDOQ2656897

Authors: Jakub Przybyło, Andrzej Żak 

Publication date: 17 March 2021

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.37236/8376

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• A flexible framework for fault tolerance in the grid
• A new fault-tolerance framework for grid computing
• Large fault-tolerant interconnection networks

zbMATH Keywords

\(t\)-node fault tolerant graphlargest component of a graph

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• Explicit construction of linear sized tolerant networks
• A Graph Model for Fault-Tolerant Computing Systems
• The integrity of a cubic graph
• A survey of integrity
• Asymptotic Bounds on the Integrity of Graphs and Separator Theorems for Graphs
• (H,k) stable graphs with minimum size
• Two results about the hypercube
• Title not available (Why is that?)
• On Minimum Fault-Tolerant Networks
• On sparse graphs with dense long paths
• Title not available (Why is that?)

Cited In (3)

• A note on the integrity of grids
• Transformation of grids to 1-fault-tolerant graphs
• Function of structural fault tolerance and \(d\)-limited connected component of CS graph

This page was built for publication: Largest component and node fault tolerance for grids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2656897)