On the public citation graph
Some Graph-Colouring Theorems with Applications to Generalized Connection Networks
0 signed · 34 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.1002/net.3230020303openalex-snapshot
Generalized multi‐stage connection networks
inferredcites →https://doi.org/10.1016/0022-0000(78)90001-6openalex-snapshot
On rearrangeable and non-blocking switching networks
inferredcites →https://doi.org/10.1016/0022-0000(81)90040-4openalex-snapshot
Explicit constructions of linear-sized superconcentrators
inferredcites →https://doi.org/10.1109/tc.1981.6312171openalex-snapshot
A fast parallel algorithm for routing in permutation networks
inferredcites →https://doi.org/10.1109/tcom.1983.1095923openalex-snapshot
Control Algorithms for Rearrangeable Clos Networks
inferredcites →https://doi.org/10.1137/0601020openalex-snapshot
A New Lower Bound for the Number of Switches in Rearrangeable Networks
inferredcites →https://doi.org/10.1137/0603041openalex-snapshot
Rearrangeable Networks with Limited Depth
inferredcites →https://doi.org/10.1145/322326.322329openalex-snapshot
Parallel permutation and sorting algorithms and a new generalized connection network
inferredcites →https://doi.org/10.2307/2003526openalex-snapshot
Mathematical Theory of Connecting Networks and Telephone Traffic
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/net.3230250104openalex-snapshot
Multicommodity flows in simple multistage networks
inferred← citeshttps://doi.org/10.1007/978-1-4613-0281-0_14openalex-snapshot
Notes on the Complexity of Switching Networks
inferred← citeshttps://doi.org/10.1007/s10878-005-1410-yopenalex-snapshot
On 3-Stage Clos Networks with Different Nonblocking Requirements on Two Types of Calls
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50020-5openalex-snapshot
Communication Networks
inferred← citeshttps://doi.org/10.1016/j.jcta.2006.03.009openalex-snapshot
Construction of asymmetric connectors of depth two
inferred← citeshttps://doi.org/10.1016/j.osn.2023.100741openalex-snapshot
Rearrangeability and repackability of a multicast wavelength-space-wavelength elastic optical network
inferred← citeshttps://doi.org/10.1109/12.83662openalex-snapshot
Nonblocking broadcast switching networks
inferred← citeshttps://doi.org/10.1109/26.789679openalex-snapshot
On the blocking performance of EGS networks under multicast traffic
inferred← citeshttps://doi.org/10.1109/glocom.2017.8254992openalex-snapshot
A Cost Efficient Multicast Nonblocking Interconnection Network
inferred← citeshttps://doi.org/10.1109/hpsr.2007.4281250openalex-snapshot
Constructions of Given-Depth and Optimal Multirate Rearrangeably Nonblocking Distributors
inferred← citeshttps://doi.org/10.1109/icc.2004.1312818openalex-snapshot
Cost-effective constructions for nonblocking WDM multicast switching networks
inferred← citeshttps://doi.org/10.1109/lcomm.2003.821323openalex-snapshot
Rearrangeability of multicast Clos networks with middle-stage fan-out
inferred← citeshttps://doi.org/10.1109/mcom.2003.1235592openalex-snapshot
A survey of noriblocking multicast three-stage clos networks
inferred← citeshttps://doi.org/10.1109/tnet.2008.2001728openalex-snapshot
Rearrangeable and Nonblocking $[w,f]$-Distributors
inferred← citeshttps://doi.org/10.1109/tpds.2018.2817623openalex-snapshot
MCL: A Cost-Efficient Nonblocking Multicast Interconnection Network
inferred← citeshttps://doi.org/10.1109/wocc.2010.5510622openalex-snapshot
Nonblocking multicast Clos networks
inferred← citeshttps://doi.org/10.1137/05062336xopenalex-snapshot
On Multicast Rearrangeable 3-stage Clos Networks Without First-Stage Fan-Out
inferred← citeshttps://doi.org/10.5594/jmi.2019.2899713openalex-snapshot
Nonblocking Multicast Networks for Transporting Stream Media
inferred← citeshttps://doi.org/10.5594/m001844openalex-snapshot
Non-blocking Multicast Networks for Transporting Stream Media
inferred← citeshttps://doi.org/10.7936/k7707zpmopenalex-snapshot
The Edge Group Coloring Problem with Applications to Multicast Switching
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.