Bounding the Number of Tolerable Faults in Majority-Based Systems

DOI10.1007/978-3-642-13073-1_11zbMath1284.05094OpenAlexW1590249536MaRDI QIDQ3562996

Yuh-Dauh Lyuu, Ching-Lueh Chang

Publication date: 28 May 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13073-1_11

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (11)

Combinatorial model and bounds for target set selection ⋮ Dynamic monopolies and feedback vertex sets in hexagonal grids ⋮ Triggering cascades on undirected connected graphs ⋮ Modeling the spread of fault in majority-based network systems: dynamic monopolies in triangular grids ⋮ On reversible cascades in scale-free and Erdős-Rényi random graphs ⋮ Dynamic monopolies with randomized starting configuration ⋮ Dynamic monopolies in directed graphs: the spread of unilateral influence in social networks ⋮ Triggering cascades on strongly connected directed graphs ⋮ The \(t\)-latency bounded strong target set selection problem in some kinds of special family of graphs ⋮ An inclusion hierarchy of irreversible dynamos ⋮ Exact solutions for latency-bounded target set selection problem on some special families of graphs

This page was built for publication: Bounding the Number of Tolerable Faults in Majority-Based Systems