On the public citation graph
Large networks with small diameter
0 signed · 39 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/net.3230240702openalex-snapshot
New results for the degree/diameter problem
inferredcites →https://doi.org/10.1007/3-540-18099-0openalex-snapshot
Parallel Algorithms and Architectures
inferredcites →https://doi.org/10.1007/3-540-59042-0_81openalex-snapshot
A packet routing protocol for arbitrary networks
inferredcites →https://doi.org/10.1007/978-94-017-1108-1_21openalex-snapshot
Large Cayley Graphs and Digraphs with Small Degree and Diameter
inferredcites →https://doi.org/10.1007/bf01386025openalex-snapshot
Programmierung der Restklassenabz�hlung einer Gruppe nach Untergruppen
inferredcites →https://doi.org/10.1016/0095-8956(84)90012-1openalex-snapshot
Large graphs with given degree and diameter. II
inferredcites →https://doi.org/10.1016/0141-9331(87)90372-3openalex-snapshot
Parallel algorithms and architectures
inferredcites →https://doi.org/10.1016/0166-218x(92)90130-3openalex-snapshot
Examples of products giving large graphs with given degree and diameter
inferredcites →https://doi.org/10.1016/0167-8191(93)90041-iopenalex-snapshot
Constructing minimum path configurations for multiprocessor systems
inferredcites →https://doi.org/10.1016/0167-8191(93)90054-oopenalex-snapshot
Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
inferredcites →https://doi.org/10.1016/0743-7315(86)90008-0openalex-snapshot
Strategies for interconnection networks: Some methods from graph theory
inferredcites →https://doi.org/10.1016/s0304-0208(08)73544-8openalex-snapshot
Large Graphs with Given Degree and Diameter III
inferredcites →https://doi.org/10.1016/s0304-0208(13)73561-8openalex-snapshot
Annals of Discrete Mathematics
inferredcites →https://doi.org/10.1017/s0013091500008221openalex-snapshot
A practical method for enumerating cosets of a finite abstract group
inferredcites →https://doi.org/10.1109/12.123397openalex-snapshot
Small diameter symmetric networks from linear groups
inferredcites →https://doi.org/10.1109/26.111428openalex-snapshot
Representations and routing for Cayley graphs (computer networks)
inferredcites →https://doi.org/10.1109/t-c.1970.222861openalex-snapshot
Improved Construction Techniques for (d, k) Graphs
inferredcites →https://doi.org/10.1109/tc.1982.1676084openalex-snapshot
Some New Results About the (d, k) Graph Problem
inferredcites →https://doi.org/10.1109/tc.1984.1676504openalex-snapshot
Large Graphs with Given Degree and Diameter—Part I
inferredcites →https://doi.org/10.1109/tc.1986.1676827openalex-snapshot
Reducing the Diameters of Computer Networks
inferredcites →https://doi.org/10.1145/237502.237519openalex-snapshot
Universal continuous routing strategies
inferredcites →https://doi.org/10.1145/237814.237982openalex-snapshot
Universal algorithms for store-and-forward and wormhole routing
inferredcites →https://doi.org/10.1364/oam.1985.tut3openalex-snapshot
Parallel algorithms and architectures
inferredcites →https://doi.org/10.48550/arxiv.math/9411218openalex-snapshot
New large graphs with given degree and diameter
inferredcites →https://doi.org/10.7551/mitpress/1090.001.0001openalex-snapshot
Adaptation in Natural and Artificial Systems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/net.10018openalex-snapshot
Degree‐ and time‐constrained broadcast networks
inferred← citeshttps://doi.org/10.1007/10704703_18openalex-snapshot
Genetic Construction of Optimal Circulant Network Designs
inferred← citeshttps://doi.org/10.1007/3-540-48086-2_4openalex-snapshot
Visualization of Automorphisms and Vertex-Symmetry
inferred← citeshttps://doi.org/10.1007/978-3-319-20119-1_32openalex-snapshot
Design Methodology for Optimizing Optical Interconnection Networks in High Performance Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-24669-5_6openalex-snapshot
On Generalized Moore Digraphs
inferred← citeshttps://doi.org/10.1016/s0166-218x(03)00294-4openalex-snapshot
Vertex-symmetric generalized Moore graphs
inferred← citeshttps://doi.org/10.1017/s0004972709000896openalex-snapshot
TOPOLOGY OF INTERCONNECTION NETWORKS WITH GIVEN DEGREE AND DIAMETER
inferred← citeshttps://doi.org/10.1109/aero.2000.878500openalex-snapshot
Graph-theoretic fault tolerance for spacecraft bus avionics
inferred← citeshttps://doi.org/10.1109/ipdpsw.2010.5470859openalex-snapshot
Analysis of network topologies and fault-tolerant routing algorithms using binary decision diagrams
inferred← citeshttps://doi.org/10.1109/tc.2003.1190592openalex-snapshot
What designers of bus and network architectures should know about hypercubes
inferred← citeshttps://doi.org/10.5614/ejgta.2014.2.2.9openalex-snapshot
Algebraic and computer-based methods in the undirected degree/diameter problem - A brief survey
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.