On the public citation graph

Comparing interconnection networks

https://doi.org/10.1007/bfb0017137
0 signed · 63 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/jgt.3190060302openalex-snapshot
The bandwidth problem for graphs and matrices—a survey
inferredcites →https://doi.org/10.1002/jgt.3190100110openalex-snapshot
One‐legged caterpillars span hypercubes
inferredcites →https://doi.org/10.1006/jpdc.2000.1667openalex-snapshot
Performance Optimization Using Extended Critical Path Analysis in Multithreaded Programs on Multiprocessors
inferredcites →https://doi.org/10.1007/3-540-12727-5_19openalex-snapshot
Topological Bandwidth
inferredcites →https://doi.org/10.1007/3-540-16766-8_20openalex-snapshot
Linear and book embeddings of graphs
inferredcites →https://doi.org/10.1007/3-540-16766-8_23openalex-snapshot
A polynomial algorithm for recognizing small cutwidth in hypergraphs
inferredcites →https://doi.org/10.1007/bf01692067openalex-snapshot
A variation on the min cut linear arrangement problem
inferredcites →https://doi.org/10.1007/bf01758834openalex-snapshot
Optimal routing algorithms for mesh-connected processor arrays
inferredcites →https://doi.org/10.1007/bfb0036931openalex-snapshot
Minimizing width in linear layouts
inferredcites →https://doi.org/10.1007/bfb0040385openalex-snapshot
Simulating binary trees on hypercubes
inferredcites →https://doi.org/10.1007/bfb0040386openalex-snapshot
Embedding rectangular grids into square grids
inferredcites →https://doi.org/10.1007/bfb0040388openalex-snapshot
Embedding grids into hypercubes
inferredcites →https://doi.org/10.1016/0010-4485(85)90134-4openalex-snapshot
Computational aspects of VLSI
inferredcites →https://doi.org/10.1016/0020-0190(87)90173-6openalex-snapshot
The complexity of minimizing wire lengths in VLSI layouts
inferredcites →https://doi.org/10.1016/0020-0190(92)90108-8openalex-snapshot
On the complexity of tree embedding problems
inferredcites →https://doi.org/10.1016/0196-6774(84)90006-3openalex-snapshot
Improved dynamic programming algorithms for bandwidth minimization and the MinCut Linear Arrangement problem
inferredcites →https://doi.org/10.1016/0304-3975(82)90075-5openalex-snapshot
On eliminating nondeterminism from turing machines which use less than logarithm worktape space
inferredcites →https://doi.org/10.1016/0304-3975(83)90078-6openalex-snapshot
Bandwidth constraints on problems complete for polynomial time
inferredcites →https://doi.org/10.1016/0304-3975(85)90068-4openalex-snapshot
Bandwidth constrained NP-complete problems
inferredcites →https://doi.org/10.1016/0304-3975(88)90028-xopenalex-snapshot
Min cut is NP-complete for edge weighted trees
inferredcites →https://doi.org/10.1016/0743-7315(85)90026-7openalex-snapshot
Embedding of tree networks into hypercubes
inferredcites →https://doi.org/10.1109/12.5991openalex-snapshot
On embedding rectangular grids in hypercubes
inferredcites →https://doi.org/10.1109/sfcs.1986.24openalex-snapshot
How robust is the n-cube?
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.1986.1676698openalex-snapshot
Multigrid Algorithms on the Hypercube Multiprocessor
inferredcites →https://doi.org/10.1137/0211018openalex-snapshot
Graphs That are Almost Binary Trees
inferredcites →https://doi.org/10.1137/0214013openalex-snapshot
Polynomial Time Algorithms for the MIN CUT Problem on Degree Restricted Trees
inferredcites →https://doi.org/10.1137/0219037openalex-snapshot
Group Action Graphs and Parallel Architectures
inferredcites →https://doi.org/10.1145/12130.12157openalex-snapshot
Optimal simulations between mesh-connected arrays of processors
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/4221.4228openalex-snapshot
A polynomial algorithm for the min-cut linear arrangement of trees
inferredcites →https://doi.org/10.1145/62212.62229openalex-snapshot
Optimal simulations by Butterfly Networks
inferredcites →https://doi.org/10.21136/cpm.1974.117839openalex-snapshot
On cubes and dichotomic trees
inferredcites →https://doi.org/10.21136/cpm.1984.108506openalex-snapshot
On Hamiltonian circuits and spanning trees of hypercubes
inferredcites →https://doi.org/10.21236/ada200780openalex-snapshot
Optimal Simulations by Butterfly Networks
inferredcites →https://doi.org/10.7551/mitpress/1102.003.0025openalex-snapshot
Layout Permutation Problems and Well-Partially-Ordered Sets

What points at this work

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

inferred← citeshttps://doi.org/10.1006/eujc.1996.0090openalex-snapshot
Spanning Regular Caterpillars in Hypercubes
inferred← citeshttps://doi.org/10.1006/jcss.1996.0053openalex-snapshot
Towards Structured Parallel Computing on Architecture-Independent Parallel Algorithm Design for Distributed-Memory Architectures
inferred← citeshttps://doi.org/10.1007/3-540-53832-1_42openalex-snapshot
Embeddings of treelike graphs into 2-dimensional meshes
inferred← citeshttps://doi.org/10.1007/3-540-55121-2_15openalex-snapshot
Edge separators for graphs of bounded genus with applications
inferred← citeshttps://doi.org/10.1007/3-540-55808-x_23openalex-snapshot
The shuffle exchange network has a Hamiltonian path
inferred← citeshttps://doi.org/10.1007/3-540-63397-9_11openalex-snapshot
Weighted graph separators and their applications
inferred← citeshttps://doi.org/10.1007/978-3-662-25209-3_13openalex-snapshot
Embeddings of shuffle-like graphs in hypercubes
inferred← citeshttps://doi.org/10.1007/bf01184811openalex-snapshot
The Shuffle Exchange Network has a Hamiltonian Path
inferred← citeshttps://doi.org/10.1007/s004530010031openalex-snapshot
Partitioning Planar Graphs with Vertex Costs: Algorithms and Applications
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90031-nopenalex-snapshot
Edge separators for graphs of bounded genus with applications
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50023-0openalex-snapshot
General Purpose Parallel Architectures
inferred← citeshttps://doi.org/10.1016/j.disc.2005.12.050openalex-snapshot
Spanning multi-paths in hypercubes
inferred← citeshttps://doi.org/10.1016/j.jpdc.2003.08.005openalex-snapshot
The hierarchical cliques interconnection network
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00013-6openalex-snapshot
The diameter of the cube-connected cycles
inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00329-2openalex-snapshot
Optimal embeddings of odd ladders into a hypercube
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00066-9openalex-snapshot
Dense edge-disjoint embedding of complete binary trees in interconnection networks
inferred← citeshttps://doi.org/10.1017/9781316795835openalex-snapshot
Introduction to Parallel Computing
inferred← citeshttps://doi.org/10.1051/ita/1993270504651openalex-snapshot
Congestion optimale du plongement de l’hypercube $H (n)$ dans la chaîne $P(2^n)$
inferred← citeshttps://doi.org/10.1080/00150517.1994.12429205openalex-snapshot
Fibonacci Networks
inferred← citeshttps://doi.org/10.1080/10637199508915489openalex-snapshot
BOUNDARY-CONFORMING NUMERICAL GRID GENERATION ON PROCESSOR NETWORKS
inferred← citeshttps://doi.org/10.1109/hpc.1997.592122openalex-snapshot
Performance analysis of STC104 interconnection networks
inferred← citeshttps://doi.org/10.1109/icpads.1997.652550openalex-snapshot
Performance of multiple links over single link in STC104 networks
inferred← citeshttps://doi.org/10.1109/spdp.1990.143659openalex-snapshot
Compressing cube-connected cycles and butterfly networks
inferred← citeshttps://doi.org/10.1145/3230905.3230953openalex-snapshot
GRASP with Path Relinking for 2D-Bandwidth Minimization Problem
inferred← citeshttps://doi.org/10.11606/t.45.1991.tde-20220712-141710openalex-snapshot
Sintese de algoritmos paralelos para o n-cubo binario
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.