On the public citation graph
Folded Petersen cube networks: new competitors for the hypercubes
0 signed · 90 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.1007/3-540-57568-5_244openalex-snapshot
Mapping dynamic data and algorithm structures into product networks
inferredcites →https://doi.org/10.1007/3-540-58184-7_87openalex-snapshot
Efficient communication in the folded Petersen interconnection networks
inferredcites →https://doi.org/10.1007/3-540-58430-7_65openalex-snapshot
Asymptotically optimal communication algorithms on faulty folded petersen networks
inferredcites →https://doi.org/10.1007/978-3-7091-9076-0_13openalex-snapshot
Embedding one Interconnection Network in Another
inferredcites →https://doi.org/10.1016/0012-365x(92)90649-zopenalex-snapshot
The ubiquitous Petersen graph
inferredcites →https://doi.org/10.1016/0166-218x(92)90152-zopenalex-snapshot
Product-shuffle networks: toward reconciling shuffles and butterflies
inferredcites →https://doi.org/10.1016/0743-7315(91)90046-copenalex-snapshot
Embedding mesh of trees in the hypercube
inferredcites →https://doi.org/10.1016/0898-1221(87)90085-xopenalex-snapshot
Fault diameter of interconnection networks
inferredcites →https://doi.org/10.1109/12.21149openalex-snapshot
The de Bruijn multiprocessor network: a versatile parallel processing and sorting network for VLSI
inferredcites →https://doi.org/10.1109/12.2194openalex-snapshot
Flip-trees: fault-tolerant graphs with wide containers
inferredcites →https://doi.org/10.1109/12.29465openalex-snapshot
Optimum broadcasting and personalized communication in hypercubes
inferredcites →https://doi.org/10.1109/71.243525openalex-snapshot
The hyper-deBruijn networks: scalable versatile architecture
inferredcites →https://doi.org/10.1109/71.80187openalex-snapshot
Properties and performance of folded hypercubes
inferredcites →https://doi.org/10.1109/icdcs.1992.235037openalex-snapshot
A unified approach to fault-tolerant routing
inferredcites →https://doi.org/10.1109/ipps.1993.262823openalex-snapshot
Dynamic embeddings of trees and quasi-grids into hyper-de Bruijn networks
inferredcites →https://doi.org/10.1109/spdp.1991.218291openalex-snapshot
Embedding all binary trees in the hypercube
inferredcites →https://doi.org/10.1109/spdp.1993.395482openalex-snapshot
Folded Petersen cube networks: new competitors for the hypercubes
inferredcites →https://doi.org/10.1109/spdp.1994.346167openalex-snapshot
Optimal fault-tolerant communication algorithms on product networks using spanning trees
inferredcites →https://doi.org/10.1109/tc.1984.1676437openalex-snapshot
Generalized Hypercube and Hyperbus Structures for a Computer Network
inferredcites →https://doi.org/10.1145/358645.358660openalex-snapshot
The cube-connected cycles: a versatile network for parallel computation
inferredcites →https://doi.org/10.1155/1995/95759openalex-snapshot
Embeddings into Hyper Petersen Networks: YetAnother Hypercube‐Like Interconnection Topology
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1097-0037(200001)35:1<56::aid-net5>3.0.co;2-dopenalex-snapshot
Hypercomplete: A pancyclic recursive topology for large-scale distributed multicomputer systems
inferred← citeshttps://doi.org/10.1002/net.20096openalex-snapshot
The k‐degree Cayley graph and its topological properties
inferred← citeshttps://doi.org/10.1006/jpdc.1997.1414openalex-snapshot
The Hyperstar Interconnection Network
inferred← citeshttps://doi.org/10.1006/jpdc.2001.1770openalex-snapshot
Comparative Study of Product Networks
inferred← citeshttps://doi.org/10.1007/978-0-585-27268-9_3openalex-snapshot
Scalable Optical Interconnection Networks for Large-Scale Parallel Computers
inferred← citeshttps://doi.org/10.1007/978-3-030-90199-8_27openalex-snapshot
The 3-Set Tree Connectivity of the Folded Petersen Cube Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-74742-0_43openalex-snapshot
Binomial Graph: A Scalable and Fault-Tolerant Logical Network Topology
inferred← citeshttps://doi.org/10.1007/978-3-540-76890-6_30openalex-snapshot
Self-healing in Binomial Graph Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-24568-8_16openalex-snapshot
On Two-Layer Brain-Inspired Hierarchical Topologies – A Rent’s Rule Approach –
inferred← citeshttps://doi.org/10.1007/bf02944800openalex-snapshot
A new family of interconnection networks of fixed degree three
inferred← citeshttps://doi.org/10.1007/s000260050003openalex-snapshot
An Edge-Isoperimetric Problem for Powers of the Petersen Graph
inferred← citeshttps://doi.org/10.1007/s00224-001-1021-7openalex-snapshot
Hamiltonicity of the Hierarchical Cubic Network
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.1016/j.amc.2024.128673openalex-snapshot
Fault tolerability evaluation for the component edge-connectivity of folded Petersen networks
inferred← citeshttps://doi.org/10.1016/j.amc.2024.129197openalex-snapshot
2-Edge Hamiltonian connectedness: Characterization and results in data center networks
inferred← citeshttps://doi.org/10.1016/j.amc.2026.130181openalex-snapshot
Fault tolerability analysis of folded Petersen networks on the basis of l-extra edge-connectivity
inferred← citeshttps://doi.org/10.1016/j.dam.2006.06.001openalex-snapshot
Containment properties of product and power graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2007.08.058openalex-snapshot
Some topological properties of folded Petersen graph
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113632openalex-snapshot
Pull-push method: A new approach to edge-isoperimetric problems
inferred← citeshttps://doi.org/10.1016/j.jpdc.2005.06.002openalex-snapshot
A new family of interconnection networks of odd fixed degrees
inferred← citeshttps://doi.org/10.1016/j.proeng.2013.09.112openalex-snapshot
Induced Matching Partition of Petersen and Circulant Graphs
inferred← citeshttps://doi.org/10.1016/j.sysarc.2004.11.005openalex-snapshot
A generalized fault-tolerant sorting algorithm on a product network
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.01.046openalex-snapshot
Matching preclusion and conditional matching preclusion problems for the folded Petersen cube
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.05.025openalex-snapshot
Data center interconnection networks are not hyperbolic
inferred← citeshttps://doi.org/10.1016/s0167-8191(99)00069-1openalex-snapshot
Ring, torus and hypercube architectures/algorithms for parallel computing
inferred← citeshttps://doi.org/10.1016/s0743-7315(03)00116-3openalex-snapshot
A delay optimal coterie on the k-dimensional folded Petersen graph
inferred← citeshttps://doi.org/10.1016/s0920-5489(01)00080-0openalex-snapshot
Delay optimal coteries on regular symmetric networks
inferred← citeshttps://doi.org/10.1016/s0920-5489(02)00105-8openalex-snapshot
A survey of permission-based distributed mutual exclusion algorithms
inferred← citeshttps://doi.org/10.1016/s1383-7621(97)00010-6openalex-snapshot
Properties and performance of folded cube-connected cycles
inferred← citeshttps://doi.org/10.1016/s1383-7621(97)00088-xopenalex-snapshot
Product-closed networks
inferred← citeshttps://doi.org/10.1016/s1571-0653(04)00221-5openalex-snapshot
Containment Properties of Product and Power Graphs
inferred← citeshttps://doi.org/10.1080/00207160.2012.697557openalex-snapshot
Embedding of special classes of circulant networks, hypercubes and generalized Petersen graphs
inferred← citeshttps://doi.org/10.1080/00207160701684485openalex-snapshot
Fault-tolerant hamiltonicity and fault-tolerant hamiltonian connectivity of the folded Petersen cube networks
inferred← citeshttps://doi.org/10.1080/01495730108935273openalex-snapshot
DESIGN OF A PARALLEL INTERCONNECT BASED ON COMMUNICATION PATTERN CONSIDERATIONS
inferred← citeshttps://doi.org/10.1080/10637199808947390openalex-snapshot
UNIFIED PARALLEL ALGORITHMS FOR GAUSSIAN ELIMINATION WITH BACKWARD SUBSTITUTION ON PRODUCT NETWORKS
inferred← citeshttps://doi.org/10.1080/23799927.2016.1249412openalex-snapshot
Maximally matched and super matched regular graphs
inferred← citeshttps://doi.org/10.1109/71.476192openalex-snapshot
Routing in modular fault-tolerant multiprocessor systems
inferred← citeshttps://doi.org/10.1109/71.640013openalex-snapshot
Generalized algorithm for parallel sorting on product networks
inferred← citeshttps://doi.org/10.1109/71.679219openalex-snapshot
A spanning multichannel linked hypercube: a gradually scalable optical interconnection network for massively parallel computing
inferred← citeshttps://doi.org/10.1109/71.707541openalex-snapshot
A theory for total exchange in multidimensional interconnection networks
inferred← citeshttps://doi.org/10.1109/71.737700openalex-snapshot
Cyclic-cubes: a new family of interconnection networks of even fixed-degrees
inferred← citeshttps://doi.org/10.1109/71.879775openalex-snapshot
Minimal fault diameter for highly resilient product networks
inferred← citeshttps://doi.org/10.1109/icacte.2010.5579613openalex-snapshot
The forwarding index and diagnosability of folded Petersen graph
inferred← citeshttps://doi.org/10.1109/iccit.2008.53openalex-snapshot
Optimal Routing and Hamiltonian Cycle in Petersen-Torus Networks
inferred← citeshttps://doi.org/10.1109/icpp.1999.797411openalex-snapshot
Routing and embeddings in cyclic Petersen networks: an efficient extension of the Petersen graph
inferred← citeshttps://doi.org/10.1109/icpp.2004.1327923openalex-snapshot
The k-valent graph: a new family of Cayley graphs for interconnection networks
inferred← citeshttps://doi.org/10.1109/icsamos.2008.4664844openalex-snapshot
On brain-inspired hybrid topologies for nano-architectures - a Rent’s rule approach -
inferred← citeshttps://doi.org/10.1109/idsac65763.2025.11170189openalex-snapshot
Research on The Unified Formula of Some Cayley Networks
inferred← citeshttps://doi.org/10.1109/iscas.2008.4541499openalex-snapshot
Does the brain really outperform Rent’s rule?
inferred← citeshttps://doi.org/10.1109/ncm.2008.47openalex-snapshot
Petersen-Torus Networks for Multicomputer Systems
inferred← citeshttps://doi.org/10.1109/pacrim.2011.6032891openalex-snapshot
Performance comparison of hierarchical interconnection networks
inferred← citeshttps://doi.org/10.1109/pdcat.2007.40openalex-snapshot
Optimal Routing in Binomial Graph Networks
inferred← citeshttps://doi.org/10.1109/pdcat.2007.64openalex-snapshot
A Distributed Virtual Machine for Parallel Graph Reduction
inferred← citeshttps://doi.org/10.1109/tc.2004.114openalex-snapshot
Diagnosability of t-connected networks and product networks under the comparison diagnosis model
inferred← citeshttps://doi.org/10.1142/s0129054124500205openalex-snapshot
Enhancing Reliability of Folded Petersen Networks Based on Edge Partition
inferred← citeshttps://doi.org/10.1142/s0219265911003027openalex-snapshot
CIRCULAR WIRELENGTH OF GENERALIZED PETERSEN GRAPHS
inferred← citeshttps://doi.org/10.1145/253145.253261openalex-snapshot
Optimally adaptive, minimum-distance, circuit-switched routing in hypercubes
inferred← citeshttps://doi.org/10.1145/563952.563935openalex-snapshot
Pancycles and hamiltonian-connectedness of the hierarchical cubic network
inferred← citeshttps://doi.org/10.1155/2011/189434openalex-snapshot
Topological Properties of Hierarchical Interconnection Networks: A Review and Comparison
inferred← citeshttps://doi.org/10.1155/2022/3114022openalex-snapshot
The Pessimistic Diagnosability of Folded Petersen Cubes
inferred← citeshttps://doi.org/10.1360/jos171115openalex-snapshot
Topology and Routing Algorithms of Double-Loops Connected Petersen Graph Networks
inferred← citeshttps://doi.org/10.3390/s110201959openalex-snapshot
One-to-One Embedding between Honeycomb Mesh and Petersen-Torus Networks
inferred← citeshttps://doi.org/10.3934/math.2022809openalex-snapshot
The generalized 4-connectivity of folded Petersen cube networks
inferred← citeshttps://doi.org/10.4156/jcit.vol5.issue7.16openalex-snapshot
QoS Routing in General Petersen-Torus Networks: A Case Study
inferred← citeshttps://doi.org/10.4156/jcit.vol5.issue9.20openalex-snapshot
Petersen-Twisted-Torus Networks for Multiprocessor Systems
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.