On the public citation graph
Incomplete hypercubes: Algorithms and embeddings
0 signed · 67 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/inco.1993.1010openalex-snapshot
Subcube Fault-Tolerance in Hypercubes
inferredcites →https://doi.org/10.1006/jpdc.1993.1027openalex-snapshot
Fault-Tolerant Permutation Routing in Hypercubes
inferredcites →https://doi.org/10.1007/978-1-349-03521-2openalex-snapshot
Graph Theory with Applications
inferredcites →https://doi.org/10.1007/bf02090766openalex-snapshot
Optimal embeddings of butterfly-like graphs in the hypercube
inferredcites →https://doi.org/10.1016/0167-8191(90)90143-wopenalex-snapshot
Parallel graph algorithms for hypercube computers
inferredcites →https://doi.org/10.1016/0743-7315(90)90131-8openalex-snapshot
Embedding meshes in Boolean cubes by graph decomposition
inferredcites →https://doi.org/10.1016/0898-1221(88)90213-1openalex-snapshot
A survey of the theory of hypercube graphs
inferredcites →https://doi.org/10.1016/s0167-8191(05)80002-xopenalex-snapshot
Hierarchical spanning trees and distributing on incomplete hypercubes
inferredcites →https://doi.org/10.1109/icdcs.1990.89293openalex-snapshot
Structural properties of incomplete hypercube computers
inferredcites →https://doi.org/10.1109/sfcs.1986.38openalex-snapshot
Optimal simulations of tree machines
inferredcites →https://doi.org/10.1109/tc.1982.1676109openalex-snapshot
On Embedding Rectangular Grids in Square Grids
inferredcites →https://doi.org/10.1109/tc.1987.5009493openalex-snapshot
Processor Allocation in an N-Cube Multiprocessor Using Gray Codes
inferredcites →https://doi.org/10.1142/s0218126692000106openalex-snapshot
A PARALLEL ALGORITHM FOR SINGLE ROW ROUTING PROBLEMS
inferredcites →https://doi.org/10.1145/2157.322401openalex-snapshot
Cost Trade-offs in Graph Embeddings, with Applications
inferredcites →https://doi.org/10.1145/28395.28425openalex-snapshot
Reconfiguring a hypercube in the presence of faults
inferredcites →https://doi.org/10.1145/44483.44494openalex-snapshot
Optimal simulations between mesh-connected arrays of processors
inferredcites →https://doi.org/10.1145/62297.62331openalex-snapshot
Message routing in an injured hypercube
inferredcites →https://doi.org/10.1145/62297.62332openalex-snapshot
Hypercube message routing in the presence of faults
inferredcites →https://doi.org/10.1145/62297.62333openalex-snapshot
Hypercube management in the presence of node failures
inferredcites →https://doi.org/10.1145/62297.62335openalex-snapshot
Routing and broadcasting in faulty hypercube computers
inferredcites →https://doi.org/10.1145/73007.73031openalex-snapshot
Fast computation using faulty hypercubes
inferredcites →https://doi.org/10.21236/ada211910openalex-snapshot
Fast Computation Using Faulty Hypercubes
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.8058openalex-snapshot
Optimization of layout for embedding half hypercube into conventional tree architectures
inferred← citeshttps://doi.org/10.1006/jpdc.1995.1045openalex-snapshot
Incomplete Hypercubes: Embeddings of Tree-Related Networks
inferred← citeshttps://doi.org/10.1007/3-540-56891-3_7openalex-snapshot
Embeddings of tree-related networks in incomplete hypercubes
inferred← citeshttps://doi.org/10.1007/978-3-030-05054-2_1openalex-snapshot
Embedding Exchanged Hypercubes into Rings and Ladders
inferred← citeshttps://doi.org/10.1007/978-3-319-14974-5_22openalex-snapshot
A Tight Bound for Congestion of an Embedding
inferred← citeshttps://doi.org/10.1007/s10878-019-00443-9openalex-snapshot
Node set optimization problem for complete Josephus cubes
inferred← citeshttps://doi.org/10.1007/s11227-018-2612-2openalex-snapshot
An efficient algorithm for embedding exchanged hypercubes into grids
inferred← citeshttps://doi.org/10.1007/s11227-021-04129-0openalex-snapshot
An O(log2 N) algorithm for reliability assessment of augmented cubes based on h-extra edge-connectivity
inferred← citeshttps://doi.org/10.1007/s11786-011-0085-2openalex-snapshot
Linear Wirelength of Folded Hypercubes
inferred← citeshttps://doi.org/10.1016/j.dam.2008.09.013openalex-snapshot
Exact wirelength of hypercubes on a grid
inferred← citeshttps://doi.org/10.1016/j.dam.2010.12.001openalex-snapshot
Minimum average congestion of enhanced and augmented hypercubes into complete binary trees
inferred← citeshttps://doi.org/10.1016/j.dam.2011.07.003openalex-snapshot
Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength
inferred← citeshttps://doi.org/10.1016/j.dam.2011.12.007openalex-snapshot
Wirelength of hypercubes into certain trees
inferred← citeshttps://doi.org/10.1016/j.dam.2020.09.012openalex-snapshot
Reliability measure of multiprocessor system based on enhanced hypercubes
inferred← citeshttps://doi.org/10.1016/j.dam.2024.01.036openalex-snapshot
On linear layout of bicube and construction of optimal incomplete bicube
inferred← citeshttps://doi.org/10.1016/j.disopt.2015.03.001openalex-snapshot
Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees
inferred← citeshttps://doi.org/10.1016/j.ipl.2012.03.006openalex-snapshot
Embedding of hypercubes into necklace, windmill and snake graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2012.04.008openalex-snapshot
Minimum wirelength of hypercubes into n-dimensional grid networks
inferred← citeshttps://doi.org/10.1016/j.procs.2015.07.441openalex-snapshot
Embedding of Hypercube into Extended Rooted Theta Mesh
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.05.007openalex-snapshot
A linear time algorithm for embedding hypercube into cylinder and torus
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.11.049openalex-snapshot
Reliability measures in relation to the h-extra edge-connectivity of folded hypercubes
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.12.016openalex-snapshot
Embedding algorithm of spined cube into grid structure and its wirelength computation
inferred← citeshttps://doi.org/10.1016/s0030-3992(00)00100-6openalex-snapshot
Routing of 2-D switching networks by their embedding into cubes
inferred← citeshttps://doi.org/10.1016/s0167-8191(99)00111-8openalex-snapshot
The Josephus cube: A novel interconnection network
inferred← citeshttps://doi.org/10.1080/00207160.2015.1088943openalex-snapshot
Linear layout of locally twisted cubes
inferred← citeshttps://doi.org/10.1109/bcca62388.2024.10844390openalex-snapshot
Incomplete Hypercube-based Algorithms for Privacy-Preserving Data Aggregation Using Zero-Knowledge Proofs
inferred← citeshttps://doi.org/10.1109/comst.2004.5342296openalex-snapshot
A survey of topologies and performance measures for large-scale networks
inferred← citeshttps://doi.org/10.1109/tr.2021.3089466openalex-snapshot
An $O(\log _3N)$ Algorithm for Reliability Assessment of 3-Ary $n$-Cubes Based on $h$-Extra Edge Connectivity
inferred← citeshttps://doi.org/10.1142/s0129054123500053openalex-snapshot
Embedding Hierarchical Cubic Networks into k-Rooted Complete Binary Trees for Minimum Wirelength
inferred← citeshttps://doi.org/10.1142/s0129054125500066openalex-snapshot
Optimal Layout of Embedding onto Folded Hypercubes
inferred← citeshttps://doi.org/10.1142/s0129626421500043openalex-snapshot
Minimum Linear Arrangement of the Cartesian Product of Optimal Order Graph and Path
inferred← citeshttps://doi.org/10.1142/s0219265912500041openalex-snapshot
EMBEDDING VARIANTS OF HYPERCUBES WITH DILATION 2
inferred← citeshttps://doi.org/10.1142/s0219265913500187openalex-snapshot
Embedding of Hypercubes into l-Sibling Trees
inferred← citeshttps://doi.org/10.1142/s1793830919500277openalex-snapshot
r-Identifying codes in binary Hamming space, q-ary Lee space and incomplete hypercube
inferred← citeshttps://doi.org/10.1145/3498851.3498998openalex-snapshot
Embedding Cube-Connected Cycles into Grid Network for Minimum Wirelength
inferred← citeshttps://doi.org/10.3390/math7050383openalex-snapshot
Wirelength of Enhanced Hypercube into Windmill and Necklace Graphs
inferred← citeshttps://doi.org/10.35234/fumbd.1926890openalex-snapshot
A Novel Edge-Efficiency-Based Algorithm for Hamiltonian Cycle and Path Detection in Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1511.07932openalex-snapshot
Embedding of Hypercube into Cylinder
inferred← citeshttps://doi.org/10.48550/arxiv.1803.01312openalex-snapshot
Component edge connectivity of the folded hypercube
inferred← citeshttps://doi.org/10.53070/bbd.1199578openalex-snapshot
Hiperküplerde Hamilton çevriminin tespiti için yenilikçi bir yöntem
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.