On the public citation graph

Embedding torus on the star graph

0 signed · 22 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.1006/jpdc.1993.1098openalex-snapshot
Embedding Meshes on the Star Graph
inferredcites →https://doi.org/10.1007/3-540-58338-6_73openalex-snapshot
Embedding complete binary trees into star networks
inferredcites →https://doi.org/10.1007/s002240000089openalex-snapshot
Embedding Complete Binary Trees into Star and Pancake Graphs
inferredcites →https://doi.org/10.1109/12.21148openalex-snapshot
A group-theoretic model for symmetric interconnection networks
inferredcites →https://doi.org/10.1109/12.250605openalex-snapshot
Near embeddings of hypercubes into Cayley graphs on the symmetric group
inferredcites →https://doi.org/10.1109/71.494627openalex-snapshot
Two ranking schemes for efficient computation on the star interconnection network
inferredcites →https://doi.org/10.1109/hicss.1995.375502openalex-snapshot
Embeddings of complete binary trees into star graphs with congestion 1
inferredcites →https://doi.org/10.1109/hipc.1996.565815openalex-snapshot
Congestion-free dilation-2 embedding of full binary trees on star graphs
inferredcites →https://doi.org/10.1109/icpads.2002.1183375openalex-snapshot
A novel neighbourhood broadcasting algorithm on star graphs
inferredcites →https://doi.org/10.1109/spdp.1990.143600openalex-snapshot
Embedding of cycles and grids in star graphs
inferredcites →https://doi.org/10.1142/s0218126691000215openalex-snapshot
EMBEDDING OF CYCLES AND GRIDS IN STAR GRAPHS

What points at this work

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

inferred← citeshttps://doi.org/10.1049/iet-cdt:20050219openalex-snapshot
Embedding torus in hexagonal honeycomb torus
inferred← citeshttps://doi.org/10.1080/00207160701619200openalex-snapshot
Largest connected component of a star graph with faulty vertices
inferred← citeshttps://doi.org/10.1109/hipc.1996.565815openalex-snapshot
Congestion-free dilation-2 embedding of full binary trees on star graphs
inferred← citeshttps://doi.org/10.1109/iccmc.2017.8282701openalex-snapshot
Application of deep learning technique for automatic data exchange with air-gapped systems and its security concerns
inferred← citeshttps://doi.org/10.1109/icpp.2001.952043openalex-snapshot
A mathematical game and its applications to the design of interconnection networks
inferred← citeshttps://doi.org/10.1109/ipdps.2001.925019openalex-snapshot
On the VLSI area and bisection width of star graphs and hierarchical cubic networks
inferred← citeshttps://doi.org/10.1109/ncm.2008.50openalex-snapshot
Node Mapping Algorithm between Torus and Petersen-Torus Networks
inferred← citeshttps://doi.org/10.1145/382176.383019openalex-snapshot
D-ARM
inferred← citeshttps://doi.org/10.14257/ijseia.2016.10.3.17openalex-snapshot
Embedding Algorithm among Half Pancake, Pancake, and Star Graphs
inferred← citeshttps://doi.org/10.3390/s110201959openalex-snapshot
One-to-One Embedding between Honeycomb Mesh and Petersen-Torus Networks
inferred← citeshttps://doi.org/10.3745/kipsta.2008.15-a.4.189openalex-snapshot
Embedding Mesh-Like Networks into Petersen-Torus(PT) 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.