Enhancing Reliability of Folded Petersen Networks Based on Edge Partition.
- Published in:
- International Journal of Foundations of Computer Science, 2025, v. 36, n. 4, p. 583, doi. 10.1142/S0129054124500205
- By:
- Publication type:
- Article
Works matching IS 01290541 AND DT 2025 AND VI 36 AND IP 4
Results: 6
1
2
The Generalized 3-Connectivity of a Family of Regular Networks.
- Published in:
- International Journal of Foundations of Computer Science, 2025, v. 36, n. 4, p. 569, doi. 10.1142/S0129054124500199
- By:
- Publication type:
- Article
3
Some Constructions of Perfect c-Nonlinear and Pseudo-Perfect c-Nonlinear Functions.
- Published in:
- International Journal of Foundations of Computer Science, 2025, v. 36, n. 4, p. 553, doi. 10.1142/S0129054124500187
- By:
- Publication type:
- Article
4
Parametric Algorithm to Find the Largest Empty Rectangle from a Set of Line Segments.
- Published in:
- International Journal of Foundations of Computer Science, 2025, v. 36, n. 4, p. 537, doi. 10.1142/S0129054124500175
- By:
- Publication type:
- Article
5
An Efficient Algorithm to Compute Dot Product Dimension of Some Outerplanar Graphs.
- Published in:
- International Journal of Foundations of Computer Science, 2025, v. 36, n. 4, p. 501, doi. 10.1142/S0129054124500151
- By:
- Publication type:
- Article
6
The 4-Set Tree Connectivity of Folded Hypercube.
- Published in:
- International Journal of Foundations of Computer Science, 2025, v. 36, n. 4, p. 517, doi. 10.1142/S0129054124500163
- By:
- Publication type:
- Article