On the public citation graph
Large fault-tolerant interconnection networks
0 signed · 174 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/jgt.3190060215openalex-snapshot
A counterexample to a conjecture on paths of bounded length
inferredcites →https://doi.org/10.1002/jgt.3190080406openalex-snapshot
Circulants and their connectivities
inferredcites →https://doi.org/10.1002/jgt.3190080408openalex-snapshot
Diameter bounds for altered graphs
inferredcites →https://doi.org/10.1002/jgt.3190090411openalex-snapshot
Lower‐bounds on the connectivities of a graph
inferredcites →https://doi.org/10.1002/jgt.3190100103openalex-snapshot
Connectivity of circulant digraphs
inferredcites →https://doi.org/10.1002/jgt.3190110315openalex-snapshot
Diameter increase caused by edge deletion
inferredcites →https://doi.org/10.1002/net.3230120306openalex-snapshot
The complexity of finding maximum disjoint paths with length constraints
inferredcites →https://doi.org/10.1002/net.3230120405openalex-snapshot
On a measure of communication network vulnerability
inferredcites →https://doi.org/10.1002/net.3230140106openalex-snapshot
An algorithm for construction of a k‐connected graph with minimum number of edges and quasiminimal diameter
inferredcites →https://doi.org/10.1002/net.3230140405openalex-snapshot
Heuristics for finding a maximum number of disjoint bounded paths
inferredcites →https://doi.org/10.1002/net.3230180105openalex-snapshot
Generalized de Bruijn digraphs
inferredcites →https://doi.org/10.1002/net.3230190502openalex-snapshot
Edge‐vulnerability and mean distance
inferredcites →https://doi.org/10.1002/scj.4690170803openalex-snapshot
Fault‐tolerant processor interconnection networks
inferredcites →https://doi.org/10.1007/3-540-51082-6_89openalex-snapshot
On the (d,D,D,s)-digraph problem
inferredcites →https://doi.org/10.1007/bf01220924openalex-snapshot
�ber den Zusammenhang symmetrischer Graphen
inferredcites →https://doi.org/10.1007/bf01433466openalex-snapshot
Minimalen-fach kantenzusammenh�ngende Graphen
inferredcites →https://doi.org/10.1007/bf02019432openalex-snapshot
Mengerian theorems for paths of bounded length
inferredcites →https://doi.org/10.1016/0012-365x(83)90062-6openalex-snapshot
Counterexamples to theorems of Menger type for the diameter
inferredcites →https://doi.org/10.1016/0012-365x(87)90151-8openalex-snapshot
Sufficient conditions for maximally connected dense graphs
inferredcites →https://doi.org/10.1016/0020-0190(88)90204-9openalex-snapshot
Fault-tolerant routings in a K-connected network
inferredcites →https://doi.org/10.1016/0095-8956(89)90040-3openalex-snapshot
Hamiltonian decomposition of Cayley graphs of degree 4
inferredcites →https://doi.org/10.1016/0095-8956(91)90084-wopenalex-snapshot
The Hamiltonian property of generalized de Bruijn digraphs
inferredcites →https://doi.org/10.1016/0166-218x(84)90024-6openalex-snapshot
Diameter vulnerability of graphs
inferredcites →https://doi.org/10.1016/0166-218x(89)90022-xopenalex-snapshot
On forwarding indices of networks
inferredcites →https://doi.org/10.1016/0166-218x(90)90069-oopenalex-snapshot
Design of a d-connected digraph with a minimum number of edges and a quasiminimal diameter
inferredcites →https://doi.org/10.1016/0743-7315(86)90008-0openalex-snapshot
Strategies for interconnection networks: Some methods from graph theory
inferredcites →https://doi.org/10.1016/0743-7315(89)90033-6openalex-snapshot
Embedding arbitrary binary trees in a hypercube
inferredcites →https://doi.org/10.1016/0890-5401(87)90031-9openalex-snapshot
A new look at fault-tolerant network routing
inferredcites →https://doi.org/10.1016/0898-1221(87)90085-xopenalex-snapshot
Fault diameter of interconnection networks
inferredcites →https://doi.org/10.1016/s0021-9800(70)80005-9openalex-snapshot
Connectivity of transitive graphs
inferredcites →https://doi.org/10.1016/s0195-6698(84)80034-7openalex-snapshot
On the Connectivity of Cayley Digraphs
inferredcites →https://doi.org/10.1017/cbo9780511662133.005openalex-snapshot
Connectivity and edge-connectivity in finite graphs
inferredcites →https://doi.org/10.1017/cbo9781107325548.002openalex-snapshot
GRAPHS AND INTERCONNECTION NETWORKS: DIAMETER AND VULNERABILITY
inferredcites →https://doi.org/10.1038/scientificamerican0687-108openalex-snapshot
The Connection Machine
inferredcites →https://doi.org/10.1090/psapm/034/846852openalex-snapshot
Diameters of communication networks
inferredcites →https://doi.org/10.1109/12.2194openalex-snapshot
Flip-trees: fault-tolerant graphs with wide containers
inferredcites →https://doi.org/10.1109/12.8718openalex-snapshot
Connectivity of Imase and Itoh digraphs
inferredcites →https://doi.org/10.1109/31.16560openalex-snapshot
Highly fault-tolerant communication network models
inferredcites →https://doi.org/10.1109/sfcs.1986.38openalex-snapshot
Optimal simulations of tree machines
inferredcites →https://doi.org/10.1109/tc.1981.1675809openalex-snapshot
Design to Minimize Diameter on Building-Block Network
inferredcites →https://doi.org/10.1109/tc.1982.1676101openalex-snapshot
A Fault-Tolerant Communication Architecture for Distributed Systems
inferredcites →https://doi.org/10.1109/tc.1983.1676267openalex-snapshot
On the Connectivity of Some Telecommunications Networks
inferredcites →https://doi.org/10.1109/tc.1983.1676323openalex-snapshot
A Design for Directed Graphs with Minimum Diameter
inferredcites →https://doi.org/10.1109/tc.1984.1676455openalex-snapshot
Line Digraph Iterations and the (d, k) Digraph Problem
inferredcites →https://doi.org/10.1109/tc.1985.1676569openalex-snapshot
Connectivity of Regular Directed Graphs with Small Diameters
inferredcites →https://doi.org/10.1109/tc.1985.1676627openalex-snapshot
Interconnection Networks Based on a Generalization of Cube-Connected Cycles
inferredcites →https://doi.org/10.1109/tc.1985.1676633openalex-snapshot
Fault-Tolerant Routing in DeBruijn Comrnunication Networks
inferredcites →https://doi.org/10.1109/tc.1987.1676947openalex-snapshot
On an Optimally Fault-Tolerant Multiprocessor Network Architecture
inferredcites →https://doi.org/10.1109/tc.1987.1676963openalex-snapshot
Discrete Optimization Problem in Local Networks and Data Alignment
inferredcites →https://doi.org/10.1109/tc.1987.1676983openalex-snapshot
On Group Graphs and Their Fault Tolerance
inferredcites →https://doi.org/10.1109/tcs.1977.1084370openalex-snapshot
Geodetic connectivity of graphs
inferredcites →https://doi.org/10.1109/tcs.1985.1085667openalex-snapshot
Reliable circulant networks with minimum transmission delay
inferredcites →https://doi.org/10.1109/tit.1987.1057290openalex-snapshot
The forwarding index of communication networks
inferredcites →https://doi.org/10.1111/j.1749-6632.1989.tb22436.xopenalex-snapshot
An Optimization Problem in Distributed Loop Computer Networks
inferredcites →https://doi.org/10.1137/0217061openalex-snapshot
Fault Tolerance in Networks of Bounded Degree
inferredcites →https://doi.org/10.1145/10590.10599openalex-snapshot
On fault tolerant routings in general networks
inferredcites →https://doi.org/10.1145/12130.12169openalex-snapshot
Fault tolerance in networks of bounded degree
inferredcites →https://doi.org/10.1145/22145.22181openalex-snapshot
Fault tolerance of minimal path routings in a network
inferredcites →https://doi.org/10.1145/321832.321838openalex-snapshot
A Combinatorial Problem Related to Multimodule Memory Organizations
inferredcites →https://doi.org/10.1145/358645.358660openalex-snapshot
The cube-connected cycles: a versatile network for parallel computation
inferredcites →https://doi.org/10.1145/800057.808723openalex-snapshot
A new look at fault tolerant network routing
inferredcites →https://doi.org/10.1145/800057.808724openalex-snapshot
Efficient fault tolerant routings in networks
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(199910)34:3<197::aid-net4>3.0.co;2-9openalex-snapshot
On the superconnectivity and the conditional diameter of graphs and digraphs
inferred← citeshttps://doi.org/10.1002/(sici)1097-0037(200001)35:1<83::aid-net7>3.0.co;2-dopenalex-snapshot
Cluster fault-tolerant routing in star graphs
inferred← citeshttps://doi.org/10.1002/(sici)1097-0118(199608)22:4<281::aid-jgt1>3.0.co;2-hopenalex-snapshot
Distance connectivity in graphs and digraphs
inferred← citeshttps://doi.org/10.1002/jgt.3190160603openalex-snapshot
On super‐edge‐connected digraphs and bipartite digraphs
inferred← citeshttps://doi.org/10.1002/jgt.3190170105openalex-snapshot
The connectivity of large digraphs and graphs
inferred← citeshttps://doi.org/10.1002/net.20049openalex-snapshot
Diameter vulnerability of iterated line digraphs in terms of the girth
inferred← citeshttps://doi.org/10.1002/net.3230230418openalex-snapshot
Fast fault‐tolerant parallel communication for de bruijn and digit‐exchange networks using information dispersal
inferred← citeshttps://doi.org/10.1006/eujc.1997.0183openalex-snapshot
The Spectrum of de Bruijn and Kautz Graphs
inferred← citeshttps://doi.org/10.1007/3-540-55121-2_16openalex-snapshot
Line digraph iterations and the spread concept—with application to graph theory, fault tolerance, and routing
inferred← citeshttps://doi.org/10.1007/3-540-57183-3_2openalex-snapshot
The architecture of rattlesnake: A real-time multimedia network
inferred← citeshttps://doi.org/10.1007/3-540-61440-0_160openalex-snapshot
Efficient collective communication in optical networks
inferred← citeshttps://doi.org/10.1007/978-1-4757-2491-2_3openalex-snapshot
De Bruijn Digraphs, Kautz Digraphs, and Their Generalizations
inferred← citeshttps://doi.org/10.1007/978-1-4757-6048-4_45openalex-snapshot
Routing in All-Optical Networks: Algorithmic and Graph-Theoretic Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-71840-8_11openalex-snapshot
Miscellaneous Digraph Classes
inferred← citeshttps://doi.org/10.1007/978-3-642-02250-0_1openalex-snapshot
Graphs and Algorithms in Communication Networks on Seven League Boots
inferred← citeshttps://doi.org/10.1007/bfb0097975openalex-snapshot
OTIS-Based multi-hop multi-OPS lightwave networks
inferred← citeshttps://doi.org/10.1016/0012-365x(92)00051-ropenalex-snapshot
The superconnectivity of large digraphs and graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(93)90355-wopenalex-snapshot
Connectivity of kautz networks
inferred← citeshttps://doi.org/10.1016/0012-365x(94)00084-vopenalex-snapshot
On the diameter vulnerability of Kautz digraphs
inferred← citeshttps://doi.org/10.1016/0012-365x(94)90157-0openalex-snapshot
On the distance connectivity of graphs and digraphs
inferred← citeshttps://doi.org/10.1016/0012-365x(96)83094-9openalex-snapshot
Diameter vulnerability of iterated line digraphs
inferred← citeshttps://doi.org/10.1016/0020-0190(96)00011-7openalex-snapshot
On fault-tolerant embedding of Hamiltonian circuits in line digraph interconnection networks
inferred← citeshttps://doi.org/10.1016/0095-8956(91)90084-wopenalex-snapshot
The Hamiltonian property of generalized de Bruijn digraphs
inferred← citeshttps://doi.org/10.1016/0165-6074(91)90407-kopenalex-snapshot
On hardware for generating routes in Kautz digraphs
inferred← citeshttps://doi.org/10.1016/0165-6074(92)90102-dopenalex-snapshot
On the design of a dynamic reconfigurable network switch
inferred← citeshttps://doi.org/10.1016/0166-218x(90)90069-oopenalex-snapshot
Design of a d-connected digraph with a minimum number of edges and a quasiminimal diameter
inferred← citeshttps://doi.org/10.1016/0166-218x(91)90117-fopenalex-snapshot
The covering radius of doubled 2-designs in 2 O
inferred← citeshttps://doi.org/10.1016/0166-218x(92)90128-wopenalex-snapshot
Stirling networks: a versatile combinatorial topology for multiprocessor systems
inferred← citeshttps://doi.org/10.1016/0166-218x(92)90154-3openalex-snapshot
The covering radius of Hadamard codes in odd graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(92)90155-4openalex-snapshot
Super edge-connectivity of dense digraphs and graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(92)90156-5openalex-snapshot
The underlying graph of a line digraph
inferred← citeshttps://doi.org/10.1016/0166-218x(93)e0165-uopenalex-snapshot
Large (d, D, D′, s)-bipartite digraphs
inferred← citeshttps://doi.org/10.1016/0166-218x(94)00113-ropenalex-snapshot
Design of a d-connected digraph with a minimum number of edges and a quasiminimal diameter: II
inferred← citeshttps://doi.org/10.1016/0166-218x(94)00127-yopenalex-snapshot
Diameter-vulnerability of large bipartite digraphs
inferred← citeshttps://doi.org/10.1016/0166-218x(95)00097-bopenalex-snapshot
Bipartite graphs and digraphs with maximum connectivity
inferred← citeshttps://doi.org/10.1016/0166-218x(95)00118-bopenalex-snapshot
On the number of spanning trees and Eulerian tours in iterated line digraphs
inferred← citeshttps://doi.org/10.1016/0898-1221(95)00146-popenalex-snapshot
Extension of de Bruijn graph and Kautz graph
inferred← citeshttps://doi.org/10.1016/b978-0-44-313517-0.00018-4openalex-snapshot
Interconnection networks
inferred← citeshttps://doi.org/10.1016/j.aam.2009.01.005openalex-snapshot
Edge, vertex and mixed fault diameters
inferred← citeshttps://doi.org/10.1016/j.dam.2011.11.020openalex-snapshot
Mixed fault diameter of Cartesian graph bundles
inferred← citeshttps://doi.org/10.1016/j.dam.2014.08.025openalex-snapshot
Improved upper bounds for vertex and edge fault diameters of Cartesian graph bundles
inferred← citeshttps://doi.org/10.1016/j.jctb.2019.08.003openalex-snapshot
Approximate Moore Graphs are good expanders
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.113859openalex-snapshot
The partial diagnosability of interconnection networks under the Hybrid PMC model
inferred← citeshttps://doi.org/10.1016/s0012-365x(01)00383-1openalex-snapshot
On the superconnectivity of generalized p-cycles
inferred← citeshttps://doi.org/10.1016/s0012-365x(02)00436-3openalex-snapshot
On connectivity of consecutive-d digraphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(96)00218-xopenalex-snapshot
Extraconnectivity of graphs with large minimum degree and girth
inferred← citeshttps://doi.org/10.1016/s0012-365x(96)00314-7openalex-snapshot
On the order and size of s-geodetic digraphs with given connectivity
inferred← citeshttps://doi.org/10.1016/s0012-365x(97)00079-4openalex-snapshot
Super line-connectivity of consecutive-d digraphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(97)00313-0openalex-snapshot
Connectivity of large bipartite digraphs and graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(98)00163-0openalex-snapshot
Extraconnectivity of s-geodetic digraphs and graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(98)00223-4openalex-snapshot
Superconnectivity of bipartite digraphs and graphs
inferred← citeshttps://doi.org/10.1016/s0024-3795(97)10072-6openalex-snapshot
On the matrix equation Al + Al+k = Jn
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00594-2openalex-snapshot
Diameter vulnerability of GC graphs
inferred← citeshttps://doi.org/10.1016/s0166-218x(97)00015-2openalex-snapshot
Fault-tolerant routings in double fixed-step networks
inferred← citeshttps://doi.org/10.1016/s0304-3975(03)00282-2openalex-snapshot
Super link-connectivity of iterated line digraphs
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00018-8openalex-snapshot
Efficient collective communication in optical networks
inferred← citeshttps://doi.org/10.1023/a:1010088407041openalex-snapshot
Algorithms for Dynamic Routing in All-Optical Networks
inferred← citeshttps://doi.org/10.1088/1742-6596/1706/1/012050openalex-snapshot
Communication Structures, its graph representation and decomposition possibilities
inferred← citeshttps://doi.org/10.1088/1742-6596/1850/1/012032openalex-snapshot
Path and Star Decomposition of Knodel and Fibonacci Digraphs
inferred← citeshttps://doi.org/10.1088/1742-6596/2099/1/012054openalex-snapshot
The diameter vulnerability of two-dimensional optimal circulant networks
inferred← citeshttps://doi.org/10.1109/12.223681openalex-snapshot
Line digraph iterations and connectivity analysis of de Bruijn and Kautz graphs
inferred← citeshttps://doi.org/10.1109/12.485369openalex-snapshot
DCC linear congruential graphs: a new class of interconnection networks
inferred← citeshttps://doi.org/10.1109/12.805162openalex-snapshot
On a lightwave network topology using Kautz digraphs
inferred← citeshttps://doi.org/10.1109/12.8718openalex-snapshot
Connectivity of Imase and Itoh digraphs
inferred← citeshttps://doi.org/10.1109/31.192418openalex-snapshot
Toeplitz networks and their properties
inferred← citeshttps://doi.org/10.1109/31.192419openalex-snapshot
An adaptive least squares algorithm for the efficient training of artificial neural networks
inferred← citeshttps://doi.org/10.1109/71.243525openalex-snapshot
The hyper-deBruijn networks: scalable versatile architecture
inferred← citeshttps://doi.org/10.1109/71.808128openalex-snapshot
Unicast in hypercubes with large number of faulty nodes
inferred← citeshttps://doi.org/10.1109/broadnets.2006.4374319openalex-snapshot
A New Approach to Loss-Free Packet/Burst Transmission in All-Optical Networks
inferred← citeshttps://doi.org/10.1109/candar.2014.84openalex-snapshot
On the Hamiltonicity of the KCube Interconnection Network
inferred← citeshttps://doi.org/10.1109/candar.2015.15openalex-snapshot
On the Hamiltonicity, Connectivity, and Broadcasting Algorithm of the KCube
inferred← citeshttps://doi.org/10.1109/ftdcs.1992.217481openalex-snapshot
Distributed fault-tolerant routing in Kautz networks
inferred← citeshttps://doi.org/10.1109/icdcs.1990.89261openalex-snapshot
Optimal routing in the de Bruijn networks
inferred← citeshttps://doi.org/10.1109/icpads.1998.741160openalex-snapshot
Routing in hypercubes with large number of faulty nodes
inferred← citeshttps://doi.org/10.1109/icpp.1998.708475openalex-snapshot
Cluster fault tolerant routing in hypercubes
inferred← citeshttps://doi.org/10.1109/infcom.1995.515935openalex-snapshot
On multihop optical network topology using Kautz digraphs
inferred← citeshttps://doi.org/10.1109/ipps.1991.153763openalex-snapshot
An algorithm for generating node disjoint routes in Kautz digraphs
inferred← citeshttps://doi.org/10.1109/ispan.1997.645127openalex-snapshot
Node-to-node cluster fault tolerant routing in hypercubes
inferred← citeshttps://doi.org/10.1109/iwmc.1992.666150openalex-snapshot
Rattlesnake: A Network for Real-Time Multimedia Communications
inferred← citeshttps://doi.org/10.1109/tii.2019.2945004openalex-snapshot
Fault-Tolerant Cooperative Control of Multiagent Systems: A Survey of Trends and Methodologies
inferred← citeshttps://doi.org/10.1111/j.1749-6632.1989.tb22436.xopenalex-snapshot
An Optimization Problem in Distributed Loop Computer Networks
inferred← citeshttps://doi.org/10.1137/s0097539791197852openalex-snapshot
Broadcasting and Gossiping in de Bruijn Networks
inferred← citeshttps://doi.org/10.1137/s0895480195280940openalex-snapshot
Fault-Tolerant Fixed Routings in Some Families of Digraphs
inferred← citeshttps://doi.org/10.1142/s021926590400126xopenalex-snapshot
TRANSMISSION FAULT-TOLERANCE OF ITERATED LINE DIGRAPHS
inferred← citeshttps://doi.org/10.1142/s021926590900242xopenalex-snapshot
A ROUTING AND WAVELENGTH ASSIGNMENT STRATEGY FOR SUCCESSFUL TRANSMISSION IN OPTICAL NETWORKS
inferred← citeshttps://doi.org/10.1142/s1793830924500459openalex-snapshot
Edges deletion problem of hypercube graphs for some n
inferred← citeshttps://doi.org/10.11650/tjm.3.1999.1323openalex-snapshot
LINE DIGRAPH ITERATIONS AND DIAMETER VULNERABILITY
inferred← citeshttps://doi.org/10.11650/twjm/1500407128openalex-snapshot
LINE DIGRAPH ITERATIONS AND DIAMETER VULNERABILITY
inferred← citeshttps://doi.org/10.21136/cmj.1996.127293openalex-snapshot
On minimum locally $n$-(arc)-strong digraphs
inferred← citeshttps://doi.org/10.26493/1855-3974.390.1c5openalex-snapshot
Mixed fault diameter of Cartesian graph bundles II
inferred← citeshttps://doi.org/10.29304/jqcm.2018.10.1.344openalex-snapshot
On Edge Addition Problem with some graphs
inferred← citeshttps://doi.org/10.31390/gradschool_disstheses.4606openalex-snapshot
Double Loop Interconnection Networks With Minimal Transmission Delay.
inferred← citeshttps://doi.org/10.37236/35openalex-snapshot
Moore Graphs and Beyond: A survey of the Degree/Diameter Problem
inferred← citeshttps://doi.org/10.48550/arxiv.math/9411221openalex-snapshot
Notes on the connectivity of Cayley coset digraphs
inferred← citeshttps://doi.org/10.5821/dissertation-2117-94027openalex-snapshot
Grafos y digrafos con máxima conectividad y máxima distancia conectividad
inferred← citeshttps://doi.org/10.5821/dissertation-2117-94039openalex-snapshot
Redes de interconexión : contribución al estudio de su vulnerabilidad
inferred← citeshttps://doi.org/10.5821/dissertation-2117-94338openalex-snapshot
Some contributions from graph theory to the design and study of large and fault-tolerant interconnection networks
inferred← citeshttps://doi.org/10.5821/dissertation-2117-94339openalex-snapshot
Digrafs línia: alguns aspectes en comunicacions: Broadcasting i Vulnerabilitat.
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.