On the public citation graph

Optimal information dissemination in star and pancake networks

0 signed · 59 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.3230180406openalex-snapshot
A survey of gossiping and broadcasting in communication networks
inferredcites →https://doi.org/10.1016/0166-218x(94)90180-5openalex-snapshot
Methods and problems of communication in usual networks
inferredcites →https://doi.org/10.1016/0166-218x(94)90183-xopenalex-snapshot
Broadcasting on recursively decomposable Cayley graphs
inferredcites →https://doi.org/10.1109/12.21148openalex-snapshot
A group-theoretic model for symmetric interconnection networks
inferredcites →https://doi.org/10.1109/71.113085openalex-snapshot
Accuracy of memory reference traces of parallel computations in trace-drive simulation
inferredcites →https://doi.org/10.1109/71.149958openalex-snapshot
Optimal broadcasting on the star graph
inferredcites →https://doi.org/10.1109/spdp.1991.218211openalex-snapshot
Data communication and computational geometry on the star and pancake interconnection networks
inferredcites →https://doi.org/10.1109/spdp.1993.395462openalex-snapshot
Optimal information dissemination in Star and Pancake networks

What points at this work

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

inferred← citeshttps://doi.org/10.1002/1097-0037(200012)36:4<225::aid-net3>3.0.co;2-gopenalex-snapshot
Hamiltonian-laceability of star graphs
inferred← citeshttps://doi.org/10.1002/cpe.760openalex-snapshot
One‐to‐all broadcasting scheme for arbitrary static interconnection networks with bursty background traffic
inferred← citeshttps://doi.org/10.1002/net.20126openalex-snapshot
Hyper hamiltonian laceability of Cayley graphs generated by transpositions
inferred← citeshttps://doi.org/10.1006/jpdc.1998.1483openalex-snapshot
Packet Routing in Fixed-Connection Networks: A Survey
inferred← citeshttps://doi.org/10.1006/jpdc.2001.1812openalex-snapshot
A Parallel Algorithm for Lagrange Interpolation on the Star Graph
inferred← citeshttps://doi.org/10.1007/11564621_32openalex-snapshot
Parallel Clustering on the Star Graph
inferred← citeshttps://doi.org/10.1007/11576235_50openalex-snapshot
Container Problem in Burnt Pancake Graphs
inferred← citeshttps://doi.org/10.1007/11823285_117openalex-snapshot
Computing the Diameter of 17-Pancake Graph Using a PC Cluster
inferred← citeshttps://doi.org/10.1007/3-540-28347-1openalex-snapshot
Semantic Web and Peer-to-Peer: Decentralized Management and Exchange of Knowledge and Information
inferred← citeshttps://doi.org/10.1007/3-540-28347-1_5openalex-snapshot
Cayley DHTs — A Group-Theoretic Framework for Analyzing DHTs Based on Cayley Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4757-2491-2_5openalex-snapshot
Dissemination of Information in Interconnection Networks (Broadcasting & Gossiping)
inferred← citeshttps://doi.org/10.1007/978-3-540-30566-8_105openalex-snapshot
Cayley DHTs — A Group-Theoretic Framework for Analyzing DHTs Based on Cayley Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-30566-8_67openalex-snapshot
Node-to-Set Disjoint Paths Problem in Bi-rotator Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-77444-0_39openalex-snapshot
Mathematical Performance Modelling of Stretched Hypercubes
inferred← citeshttps://doi.org/10.1007/978-3-642-15672-4_12openalex-snapshot
Embedding Algorithms for Bubble-Sort, Macro-star, and Transposition Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-20975-8_27openalex-snapshot
Embedding Methods for Bubble-Sort, Pancake, and Matrix-Star Graphs
inferred← citeshttps://doi.org/10.1007/s00224-001-1034-2openalex-snapshot
One-to-Many Embeddings of Hypercubes into Cayley Graphs Generated by Reversals
inferred← citeshttps://doi.org/10.1016/j.amc.2004.06.135openalex-snapshot
Cycle embedding in star graphs with edge faults
inferred← citeshttps://doi.org/10.1016/j.ins.2003.09.023openalex-snapshot
Hyper hamiltonian laceability on edge fault star graph
inferred← citeshttps://doi.org/10.1016/j.jpdc.2005.06.010openalex-snapshot
An efficient heuristic for broadcasting in networks
inferred← citeshttps://doi.org/10.1016/j.mcm.2013.03.011openalex-snapshot
A parallel clustering algorithm on the star graph and its performance
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.02.024openalex-snapshot
The diagnosability of triangle-free graphs
inferred← citeshttps://doi.org/10.1016/s0020-0255(00)00021-9openalex-snapshot
On the fault-tolerant embedding of complete binary trees in the pancake graph interconnection network
inferred← citeshttps://doi.org/10.1016/s0164-1212(01)00121-2openalex-snapshot
On the attractiveness of the star network
inferred← citeshttps://doi.org/10.1016/s0166-218x(97)00102-9openalex-snapshot
Broadcasting in cycle prefix digraphs
inferred← citeshttps://doi.org/10.1016/s0743-7315(02)00056-4openalex-snapshot
Node-ranking schemes for the star networks
inferred← citeshttps://doi.org/10.1016/s1383-7621(03)00020-1openalex-snapshot
On the topological properties of the arrangement–star network
inferred← citeshttps://doi.org/10.1093/ietisy/e88-d.7.1678openalex-snapshot
Internally-Disjoint Paths Problem in Bi-Rotator Graphs
inferred← citeshttps://doi.org/10.1093/ietisy/e89-d.2.647openalex-snapshot
An Algorithm for Node-to-Set Disjoint Paths Problem in Bi-Rotator Graphs
inferred← citeshttps://doi.org/10.1109/12.485370openalex-snapshot
Edge-disjoint spanning trees on the star network with applications to fault tolerance
inferred← citeshttps://doi.org/10.1109/12.895865openalex-snapshot
Neighbourhood information dissemination in the star graph
inferred← citeshttps://doi.org/10.1109/12.902755openalex-snapshot
Optimally balanced spanning tree of the star network
inferred← citeshttps://doi.org/10.1109/71.969126openalex-snapshot
Optimal total exchange in Cayley graphs
inferred← citeshttps://doi.org/10.1109/access.2019.2962549openalex-snapshot
Constructing Independent Spanning Trees on Pancake Networks
inferred← citeshttps://doi.org/10.1109/aiccsa.2007.370904openalex-snapshot
Simulation-Based Performance Evaluation of Deterministic Routing in Necklace Hypercubes
inferred← citeshttps://doi.org/10.1109/aina.2014.63openalex-snapshot
New Heuristic for Message Broadcasting in Networks
inferred← citeshttps://doi.org/10.1109/icpads.2010.110openalex-snapshot
Broadcasting Algorithm Via Shortest Paths
inferred← citeshttps://doi.org/10.1109/icpp.1998.708473openalex-snapshot
Embed longest rings onto star graphs with vertex faults
inferred← citeshttps://doi.org/10.1109/ipdps.2002.1016686openalex-snapshot
One-to-all broadcasting scheme for static interconnection networks with arbitrary topology
inferred← citeshttps://doi.org/10.1109/ipdps.2002.1016687openalex-snapshot
Reliable communication in faulty star networks
inferred← citeshttps://doi.org/10.1109/ipdps.2007.370594openalex-snapshot
Performance Modelling of Necklace Hypercubes
inferred← citeshttps://doi.org/10.1109/ispan.2004.1300538openalex-snapshot
Container problem in substring reversal graphs
inferred← citeshttps://doi.org/10.1109/ispan.2005.31openalex-snapshot
Computing the Diameters of 14- and 15-Pancake Graphs
inferred← citeshttps://doi.org/10.1109/snpd-sawn.2006.61openalex-snapshot
Routing Problems in Incomplete Pancake Graphs
inferred← citeshttps://doi.org/10.1109/tr.2013.2285031openalex-snapshot
Local Diagnosis Algorithms for Multiprocessor Systems Under the Comparison Diagnosis Model
inferred← citeshttps://doi.org/10.1142/s0219265901000336openalex-snapshot
ADAPTIVE FAULT-TOLERANT ROUTING IN STAR NETWORKS
inferred← citeshttps://doi.org/10.1142/s0219265903000751openalex-snapshot
AN OPTIMAL NEIGHBOURHOOD BROADCASTING SCHEME FOR STAR INTERCONNECTION NETWORKS
inferred← citeshttps://doi.org/10.1142/s0219265916500067openalex-snapshot
An Improved Algorithm for the Node-to-Set Disjoint Paths Problem on Bi-Rotator Graphs
inferred← citeshttps://doi.org/10.1145/3613347.3613348openalex-snapshot
The Pancake Graph of Order 10 Is 4-Colorable
inferred← citeshttps://doi.org/10.14569/ijacsa.2016.070828openalex-snapshot
Efficient Load Balancing Algorithm for the Arrangement-Star Network
inferred← citeshttps://doi.org/10.5391/jkiis.2014.24.4.430openalex-snapshot
One-to-One Mapping Algorithm between Matrix Star Graphs and Half Pancake Graphs
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.