On the public citation graph

Random Regular Graph and Generalized De Bruijn Graph with k-Shortest Path Routing

https://doi.org/10.1109/ipdps.2016.44

0 signed · 24 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.1002/net.3230040405openalex-snapshot

A lower bound on the average shortest path length in regular graphs

inferredcites →https://doi.org/10.1007/978-1-4471-3886-0openalex-snapshot

Digraphs Theory Algorithms And Applications

inferredcites →https://doi.org/10.1007/bf02579310openalex-snapshot

The diameter of random regular graphs

inferredcites →https://doi.org/10.1016/s0195-6698(88)80014-3openalex-snapshot

The Isoperimetric Number of Random Regular Graphs

inferredcites →https://doi.org/10.1109/ipdps.2014.38openalex-snapshot

LFTI: A New Performance Metric for Assessing Interconnect Designs for Extreme-Scale HPC Systems

inferredcites →https://doi.org/10.1109/isca.2008.19openalex-snapshot

Technology-Driven, Highly-Scalable Dragonfly Topology

inferredcites →https://doi.org/10.1109/sc.2014.34openalex-snapshot

Slim Fly: A Cost Effective Low-Diameter Network Topology

inferredcites →https://doi.org/10.1109/tc.1981.1675809openalex-snapshot

Design to Minimize Diameter on Building-Block Network

inferredcites →https://doi.org/10.1109/tc.1983.1676323openalex-snapshot

A Design for Directed Graphs with Minimum Diameter

inferredcites →https://doi.org/10.1145/1394608.1382129openalex-snapshot

Technology-Driven, Highly-Scalable Dragonfly Topology

inferredcites →https://doi.org/10.1145/2366231.2337179openalex-snapshot

A case for random shortcut topologies for HPC interconnects

inferredcites →https://doi.org/10.1145/2503210.2503229openalex-snapshot

A new routing scheme for Jellyfish and its performance with HPC workloads

inferredcites →https://doi.org/10.48550/arxiv.1110.1687openalex-snapshot

Jellyfish: Networking Data Centers Randomly

inferredcites →https://doi.org/10.48550/arxiv.1309.7066openalex-snapshot

High Throughput Data Center Topology Design

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-319-72971-8_7openalex-snapshot

Modeling UGAL on the Dragonfly Topology

inferred← citeshttps://doi.org/10.1109/access.2019.2962392openalex-snapshot

A Novel Vector-Based Dynamic Path Planning Method in Urban Road Network

inferred← citeshttps://doi.org/10.1109/ccdc.2017.7978950openalex-snapshot

An inter-domain routing scheme for software-defined optical network

inferred← citeshttps://doi.org/10.1109/ccgrid.2018.00066openalex-snapshot

A Comparative Study of Topology Design Approaches for HPC Interconnects

inferred← citeshttps://doi.org/10.1109/hoti.2017.21openalex-snapshot

Throughput Models of Interconnection Networks: The Good, the Bad, and the Ugly

inferred← citeshttps://doi.org/10.1109/tpds.2018.2884472openalex-snapshot

2018 Index IEEE Transactions on Parallel and Distributed Systems Vol. 29

inferred← citeshttps://doi.org/10.17760/d20429190openalex-snapshot

Network representation for incomplete or sequential data

inferred← citeshttps://doi.org/10.3390/ijgi12030127openalex-snapshot

Dynamic Weighted Road Network Based Multi-Vehicles Navigation and Evacuation

inferred← citeshttps://doi.org/10.4018/ijcac.339892openalex-snapshot

A Distributed Cloud Architecture Based on General De Bruijn Overlay Network

inferred← citeshttps://doi.org/10.5753/latinoware.2021.19903openalex-snapshot

Utilizando Modelagem e Simulação para Avaliação do Grau de Esforço no Deslocamento de Usuários de Cadeiras de Rodas

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.