Pages that link to "Item:Q3562996"
From MaRDI portal
The following pages link to Bounding the Number of Tolerable Faults in Majority-Based Systems (Q3562996):
Displaying 11 items.
- Exact solutions for latency-bounded target set selection problem on some special families of graphs (Q260041) (← links)
- Combinatorial model and bounds for target set selection (Q410735) (← links)
- Modeling the spread of fault in majority-based network systems: dynamic monopolies in triangular grids (Q427907) (← links)
- Triggering cascades on strongly connected directed graphs (Q500995) (← links)
- Dynamic monopolies with randomized starting configuration (Q653331) (← links)
- Triggering cascades on undirected connected graphs (Q1944178) (← links)
- On reversible cascades in scale-free and Erdős-Rényi random graphs (Q1946489) (← links)
- The \(t\)-latency bounded strong target set selection problem in some kinds of special family of graphs (Q2025100) (← links)
- An inclusion hierarchy of irreversible dynamos (Q2355698) (← links)
- Dynamic monopolies and feedback vertex sets in hexagonal grids (Q2429050) (← links)
- Dynamic monopolies in directed graphs: the spread of unilateral influence in social networks (Q2449109) (← links)