Upper bounds on the connection probability for 2-D meshes and tori
From MaRDI portal
Publication:433405
DOI10.1016/J.JPDC.2011.11.006zbMATH Open1242.68006OpenAlexW2038745738MaRDI QIDQ433405FDOQ433405
Meilian Liang, Jiarong Liang, Xiaodong Xu, Zehui Shao
Publication date: 13 July 2012
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jpdc.2011.11.006
Recommendations
- The random connection model on the torus
- On simple connectivity of random 2-complexes
- Strong rainbow connection numbers of toroidal meshes
- On the \((l, 2n)\)-domination number of the \(n\)-dimensional undirected toroidal mesh
- On the probability of connectedness
- Homological connectivity of random 2-complexes
- Total and paired domination numbers of toroidal meshes
- Bounds on probability of connectedness of a random graph
- Lower bounds on the connectivity function in all directions for Bernoulli percolation in two and three dimensions
Mathematical problems of computer architecture (68M07) Network design and communication in computer systems (68M10)
Cites Work
- Title not available (Why is that?)
- A Fault-Tolerant Communication Architecture for Distributed Systems
- Probability Inequalities
- Fault-tolerant wormhole routing in mesh with overlapped solid fault regions
- Dynamically Restructurable Fault-Tolerant Processor Network Architectures
- Locally subcube-connected hypercube networks: theoretical analysis and experimental results
- Practical Deadlock-Free Fault-Tolerant Routing in Meshes Based on the Planar Network Fault Model
- Routing complexity of faulty networks
- Probabilistic analysis on mesh network fault tolerance
Cited In (6)
- Title not available (Why is that?)
- Strong matching preclusion for two-dimensional torus networks
- \(L(2, 1)\)-labeling of the Cartesian and strong product of two directed cycles
- The reliability analysis of \(k\)-ary \(n\)-cube networks
- On the reliability of alternating group graph-based networks
- Estimating the subsystem reliability of bubblesort networks
This page was built for publication: Upper bounds on the connection probability for 2-D meshes and tori
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q433405)
