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
-
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) -
Loop-invariant Optimization in the Pifagor Language
by: Vladimir S. Vasilev, et al.
Published: (2018-08-01) -
Application of the algorithm for finding the outer median of a graph in the problems of determining the reliability of technical systems
by: Yuri A. Plaksa, et al.
Published: (2023-09-01) -
On Conditional Independence Graph Learning From Multi-Attribute Gaussian Dependent Time Series
by: Jitendra K. Tugnait
Published: (2025-01-01)