On the public citation graph

A Constant Time Optimal Routing Algorithm for Undirected Double-Loop Networks

0 signed · 28 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-540-30497-5_4openalex-snapshot
Optimal Designs of Directed Double-Loop Networks
inferredcites →https://doi.org/10.1007/b104566openalex-snapshot
Computational and information science : first International Symposium, CIS 2004, Shanghai, China, December 16-18, 2004 : proceedings
inferredcites →https://doi.org/10.1016/0012-365x(95)94025-8openalex-snapshot
An efficient algorithm to find optimal double loop networks
inferredcites →https://doi.org/10.1016/0196-6774(88)90030-2openalex-snapshot
Diameters of weighted double loop networks
inferredcites →https://doi.org/10.1016/s0020-0190(98)00013-1openalex-snapshot
An optimal message routing algorithm for double-loop networks
inferredcites →https://doi.org/10.1016/s0020-0190(98)00099-4openalex-snapshot
Finding shortest paths in distributed loop networks
inferredcites →https://doi.org/10.1016/s0304-3975(00)00243-7openalex-snapshot
A complementary survey on double-loop networks
inferredcites →https://doi.org/10.1016/s0304-3975(01)00341-3openalex-snapshot
A survey on multi-loop networks
inferredcites →https://doi.org/10.1109/12.477250openalex-snapshot
Fault-tolerant routing in distributed loop networks
inferredcites →https://doi.org/10.1109/12.869330openalex-snapshot
The minimum distance diagram of double-loop networks
inferredcites →https://doi.org/10.1109/12.869331openalex-snapshot
Reaching fault diagnosis agreement under a hybrid fault model
inferredcites →https://doi.org/10.1109/tc.1987.1676963openalex-snapshot
Discrete Optimization Problem in Local Networks and Data Alignment
inferredcites →https://doi.org/10.1109/tcs.1985.1085667openalex-snapshot
Reliable circulant networks with minimum transmission delay
inferredcites →https://doi.org/10.1142/s0129054192000188openalex-snapshot
ROUTING ALGORITHMS FOR DOUBLE LOOP NETWORKS
inferredcites →https://doi.org/10.1145/321832.321838openalex-snapshot
A Combinatorial Problem Related to Multimodule Memory Organizations

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1016/j.heliyon.2020.e04427openalex-snapshot
Routing in triple loop circulants: A case of networks-on-chip
inferred← citeshttps://doi.org/10.1109/access.2020.3040323openalex-snapshot
Shortest Path Search Algorithm in Optimal Two-Dimensional Circulant Networks: Implementation for Networks-on-Chip
inferred← citeshttps://doi.org/10.1109/access.2021.3131635openalex-snapshot
Adaptive Dynamic Shortest Path Search Algorithm in Networks-on-Chip Based on Circulant Topologies
inferred← citeshttps://doi.org/10.1109/access.2025.3579790openalex-snapshot
A New Approach for Automatic Search for Families of Optimal Undirected Double-Loop Networks
inferred← citeshttps://doi.org/10.1109/tnse.2022.3211985openalex-snapshot
Routing Algorithms in Optimal Degree Four Circulant Networks Based on Relative Addressing: Comparative Analysis for Networks-on-Chip
inferred← citeshttps://doi.org/10.1134/s1990478925020085openalex-snapshot
A Scalable Approach to Codesign of Topologies and Routing Algorithms for Families of Optimal Degree-Four Circulant Networks
inferred← citeshttps://doi.org/10.1134/s1995080223120351openalex-snapshot
The Problem of a Symmetric Graph with a Maximum Number of Vertices and Minimum Diameter
inferred← citeshttps://doi.org/10.1142/s1793830912500024openalex-snapshot
A SURVEY ON UNDIRECTED CIRCULANT GRAPHS
inferred← citeshttps://doi.org/10.17223/20710410/47/7openalex-snapshot
A COMPUTATION OF THE SHORTEST PATHS IN OPTIMAL TWO-DIMENSIONAL CIRCULANT NETWORKS
inferred← citeshttps://doi.org/10.26907/2541-7746.2026.2.269-286openalex-snapshot
Simulation of specialized routing algorithms in networks-on-chip represented by series of circulant topology families
inferred← citeshttps://doi.org/10.3390/bdcc7020080openalex-snapshot
The Dataset for Optimal Circulant Topologies
inferred← citeshttps://doi.org/10.3390/mi14010141openalex-snapshot
Ring-Split: Deadlock-Free Routing Algorithm for Circulant Networks-on-Chip
inferred← citeshttps://doi.org/10.46298/dmtcs.377openalex-snapshot
Some new optimal and suboptimal infinite families of undirected double-loop networks
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.