On the public citation graph
Hierarchical star: a new two level interconnection network
0 signed · 51 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.1006/jpdc.1994.1066openalex-snapshot
On Some Properties and Algorithms for the Star and Pancake Interconnection Networks
inferredcites →https://doi.org/10.1016/0020-0190(91)90107-sopenalex-snapshot
Decomposing a star graph into disjoint cycles
inferredcites →https://doi.org/10.1016/0020-0190(93)90087-popenalex-snapshot
Fault diameter of star 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.29465openalex-snapshot
Optimum broadcasting and personalized communication in hypercubes
inferredcites →https://doi.org/10.1109/71.149958openalex-snapshot
Optimal broadcasting on the star graph
inferredcites →https://doi.org/10.1109/71.262586openalex-snapshot
A comparative study of topological properties of hypercubes and star graphs
inferredcites →https://doi.org/10.1109/71.282562openalex-snapshot
A parallel algorithm for computing Fourier transforms on the star graph
inferredcites →https://doi.org/10.1109/71.395400openalex-snapshot
Algorithms and properties of a new two-level network with folded hypercubes as basic modules
inferredcites →https://doi.org/10.1109/71.80187openalex-snapshot
Properties and performance of folded hypercubes
inferredcites →https://doi.org/10.1109/tc.1984.1676437openalex-snapshot
Generalized Hypercube and Hyperbus Structures for a Computer Network
inferredcites →https://doi.org/10.1142/s0218126691000215openalex-snapshot
EMBEDDING OF CYCLES AND GRIDS IN STAR GRAPHS
inferredcites →https://doi.org/10.1145/563952.563937openalex-snapshot
Metacube: a new interconnection network for large scale parallel systems
inferredcites →https://doi.org/10.1145/76263.76310openalex-snapshot
The HCN: a versatile interconnection network based on cubes
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-642-28073-3_5openalex-snapshot
Mstar : A New Two Level Interconnection Network
inferred← citeshttps://doi.org/10.1007/s10878-026-01469-6openalex-snapshot
$$K_{1,r}$$-structure connectivity and neighbor connectivity in hierarchical networks
inferred← citeshttps://doi.org/10.1007/s11227-009-0288-3openalex-snapshot
The hybrid dynamic parallel scheduling algorithm for load balancing on Chained-Cubic Tree interconnection networks
inferred← citeshttps://doi.org/10.1007/s11227-017-2186-4openalex-snapshot
The hierarchical Petersen network: a new interconnection network with fixed degree
inferred← citeshttps://doi.org/10.1007/s11227-019-03115-xopenalex-snapshot
Design and analysis of the rotational binary graph as an alternative to hypercube and Torus
inferred← citeshttps://doi.org/10.1007/s11227-025-07542-xopenalex-snapshot
Component connectivity of hierarchical pancake graphs
inferred← citeshttps://doi.org/10.1016/j.amc.2025.129603openalex-snapshot
Neighbor connectivity of hierarchical pancake networks
inferred← citeshttps://doi.org/10.1016/j.amc.2025.129644openalex-snapshot
Conditional (edge) neighbor connectivity of hierarchical star networks
inferred← citeshttps://doi.org/10.1016/j.dam.2021.01.020openalex-snapshot
On g -good-neighbor conditional connectivity and diagnosability of hierarchical star networks
inferred← citeshttps://doi.org/10.1016/j.dam.2021.11.006openalex-snapshot
Measurement and algorithm for conditional local diagnosis of regular networks under the MM* model
inferred← citeshttps://doi.org/10.1016/j.jpdc.2005.05.005openalex-snapshot
Leader election in hierarchical star network
inferred← citeshttps://doi.org/10.1016/j.jpdc.2006.03.008openalex-snapshot
An oblivious shortest-path routing algorithm for fully connected cubic networks
inferred← citeshttps://doi.org/10.1016/j.jpdc.2022.09.010openalex-snapshot
Subversion analyses of hierarchical networks based on (edge) neighbor connectivity
inferred← citeshttps://doi.org/10.1016/j.proeng.2011.08.533openalex-snapshot
Modeling Several Multistage Interconnection Networks with Unified Cayley Formulation
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.04.022openalex-snapshot
A class of hierarchical graphs as topologies for interconnection networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.05.006openalex-snapshot
Relationship between extra edge connectivity and component edge connectivity for regular graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115596openalex-snapshot
A generalized approach for solving non-inclusive diagnosability of regular networks under the PMC model
inferred← citeshttps://doi.org/10.1016/j.tcs.2026.115904openalex-snapshot
The g-good-neighbor diagnosability of lexicographic product networks under the PMC model
inferred← citeshttps://doi.org/10.1080/23799927.2018.1467488openalex-snapshot
Fault-tolerance and diagnosability of hierarchical star networks
inferred← citeshttps://doi.org/10.1109/cso.2009.186openalex-snapshot
Load Balancing on Semi-direct Product and Hierarchical Star Interconnection Networks
inferred← citeshttps://doi.org/10.1109/icaiet65052.2025.11211239openalex-snapshot
StarTH vs THStar: The Advantage of Lower Diameter
inferred← citeshttps://doi.org/10.1109/tetc.2024.3387119openalex-snapshot
LP-Star: Embedding Longest Paths into Star Networks With Large-Scale Missing Edges Under an Emerging Assessment Model
inferred← citeshttps://doi.org/10.1142/s0129054118500090openalex-snapshot
Optimal Bounds for Disjoint Hamilton Cycles in Star Graphs
inferred← citeshttps://doi.org/10.1142/s0129054120500100openalex-snapshot
On Component Connectivity of Hierarchical Star Networks
inferred← citeshttps://doi.org/10.1142/s0129054123500156openalex-snapshot
A Recursive Algorithm for Constructing Dual-CISTs in Hierarchical Folded Cubic Networks
inferred← citeshttps://doi.org/10.1142/s0129626426500155openalex-snapshot
Hierarchical One-Link Interconnection Networks for Low-Degree Parallel Communication
inferred← citeshttps://doi.org/10.1142/s0219265917410018openalex-snapshot
The 1-Good-Neighbor Conditional Diagnosability of Some Regular Graphs
inferred← citeshttps://doi.org/10.1142/s0219265923500019openalex-snapshot
Hyper Star Fault Tolerance of Hierarchical Star Networks
inferred← citeshttps://doi.org/10.1142/s0219265925500100openalex-snapshot
The h-Extra Edge-Connectivity of Hierarchical Pancake Graphs
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.1515/math-2022-0490openalex-snapshot
Generalized 4-connectivity of hierarchical star networks
inferred← citeshttps://doi.org/10.21203/rs.3.rs-3336812/v1openalex-snapshot
The Diagnostic Degree and Diagnostic Algorithmfor t/s in Hierarchical Star Graphs
inferred← citeshttps://doi.org/10.2478/cait-2021-0003openalex-snapshot
Hierarchical Hexagon: A New Fault-Tolerant Interconnection Network for Parallel Systems
inferred← citeshttps://doi.org/10.3745/kipsta.2009.16a.6.501openalex-snapshot
Symmetry and Embedding Algorithm of Interconnection Networks Folded Hyper-Star FHS(2n,n)
inferred← citeshttps://doi.org/10.3906/elk-1202-44openalex-snapshot
Star-crossed cube: an alternative to star graph
inferred← citeshttps://doi.org/10.4018/ijaec.2016010105openalex-snapshot
Properties and Performance of Cube-Based Multiprocessor Architectures
inferred← citeshttps://doi.org/10.48550/arxiv.1909.06497openalex-snapshot
Load-balanced Routing for Nested Interconnection 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.