A New Approach for Automatic Search for Families of Optimal Undirected Double-Loop Networks
Based on the analysis of a large dataset for optimal undirected double-loop networks, we studied the problem of finding families of optimal double-loop graphs with the minimal possible diameter. Optimal double-loop networks are of practical interest as graph models for reliable, low-delay communicat...
Saved in:
| Main Authors: | Emilia A. Monakhova, Oleg G. Monakhov, Edward R. Rzaev, Aleksandr A. Amerikanov, Mikhail Y. Romashikhin, Aleksandr Y. Romanov |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2025-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/11036794/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Method to calculate the diameter of undirected double-loop networks G(N;±1,±s)
by: FANG Mu-yun1, et al.
Published: (2007-01-01) -
Searching for Similar Subgraphs in an Unweighted Undirected Graph by Computing Isomorphic Path Sets
by: Valentin Sysoev, et al.
Published: (2024-03-01) -
Methods for assessing the connectivity of an undirected bipolar labeled graph taking into account the destructive impact of external threats on its vertices
by: V. A. Voevodin, et al.
Published: (2024-04-01) -
Inverse neutrosophic mixed graphs
by: Thempaavai Jayaprakash, et al.
Published: (2024-07-01) -
Learning Multi-Attribute Differential Graphs With Non-Convex Penalties
by: Jitendra K. Tugnait
Published: (2025-01-01)