Synthesis of reliable networks - a survey
From MaRDI portal
Publication:3740538
DOI10.1109/TR.1986.4335424zbMATH Open0603.90060OpenAlexW2088535325MaRDI QIDQ3740538FDOQ3740538
Authors:
Publication date: 1986
Published in: IEEE Transactions on Reliability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tr.1986.4335424
Recommendations
- A survey of some network reliability analysis and synthesis results
- scientific article; zbMATH DE number 3878650
- On unreliability polynomials and graph connectivity in reliable network synthesis
- The problem of synthesis of reliable networks
- Combinatorial optimization problems in the analysis and design of probabilistic networks
Deterministic network models in operations research (90B10) Reliability, availability, maintenance, inspection in operations research (90B25)
Cited In (91)
- The Menger number of the Cartesian product of graphs
- Realizability of fault-tolerant graphs
- Superconnectivity of graphs with odd girth \(g\) and even girth \(h\)
- Semi-hyper-connected vertex transitive graphs
- Diameter-sufficient conditions for a graph to be super-restricted connected
- Connectivity measures in matched sum graphs
- Diameter, short paths and superconnectivity in digraphs
- Sufficient conditions for bipartite graphs to be super-\(k\)-restricted edge connected
- On restricted connectivities of permutation graphs
- On the edge-connectivity and restricted edge-connectivity of a product of graphs
- On the super connectivity of Kronecker products of graphs
- Heuristic maximization of the number of spanning trees in regular graphs
- Super-connected arc-transitive digraphs
- Connectivity and super connectivity of the divide-and-swap cube
- A survey of some network reliability analysis and synthesis results
- Network design and defence
- Superconnected and hyperconnected small degree transitive graphs
- The superconnectivity of large digraphs and graphs
- Design of reliable networks
- Super edge-connectivity of dense digraphs and graphs
- Edge fault tolerance analysis of super \(k\)-restricted connected networks
- The super connectivity of augmented cubes
- Optimally Reliable Graphs for Both Vertex and Edge Failures
- Super-connectivity and hyper-connectivity of vertex transitive bipartite graphs
- Calculating the extremal number \(ex(v;\{C_3,C_4,\dots,C_n\})\)
- Super connectivity of line graphs
- On the connectivity and restricted edge-connectivity of 3-arc graphs
- Connectivity of vertex and edge transitive graphs
- The super connectivity of exchanged crossed cube
- Superconnectivity of bipartite digraphs and graphs
- On \(g\)-extra connectivity of folded hypercubes
- The expected number of pairs of connected nodes: Pair-connected reliability
- Realizability of p-point graphs with prescribed minimum degree, maximum degree, and point-connectivity
- Sufficient conditions for super-arc-strongly connected oriented graphs
- On the restricted connectivity and superconnectivity in graphs with given girth
- Semi-hyper-connected edge transitive graphs
- A bootstrap heuristic for designing minimum cost survivable networks
- The super connectivity of exchanged hypercubes
- Edge-connectivity and super edge-connectivity of \(P_{2}\)-path graphs
- On the super-restricted arc-connectivity of \(s\)-geodetic digraphs
- The super connectivity of folded crossed cubes
- On the connectivity and superconnected graphs with small diameter
- Superconnectivity of regular graphs with small diameter
- On the construction of most reliable networks
- On the superconnectivity in graphs with odd girth \(g\) and even girth \(h\)
- Optimally reliable networks
- Super connectivity of balanced hypercubes
- Restricted connectivity for some interconnection networks
- Toughness of the corona of two graphs
- Super \(p\)-restricted edge connectivity of line graphs
- The existence and upper bound for two types of restricted connectivity
- Super connectivity of folded twisted crossed cubes
- Capacity factors in a point-to-point network
- Matching preclusion and conditional matching preclusion for bipartite interconnection networks. I: Sufficient conditions
- Diameter-girth sufficient conditions for optimal extraconnectivity in graphs
- Super edge connectivity properties of connected edge symmetric graphs
- On unreliability polynomials and graph connectivity in reliable network synthesis
- On super connectivity of Cartesian product graphs
- On the 3-restricted edge connectivity of permutation graphs
- Linearly many faults in \((n,k)\)-star graphs
- The problem of synthesis of reliable networks
- Superconnected digraphs and graphs with small conditional diameters
- Connectivity and super connectivity of the exchanged 3-ary \(n\)-cube
- Connectedness of digraphs and graphs under constraints on the conditional diameter
- Vertex-transitive graphs that remain connected after failure of a vertex and its neighbors
- Highly connected star product graphs
- The reliability of lexicographic product digraphs
- On \(g\)-extra connectivity of hypercube-like networks
- Restricted arc-connectivity of unidirectional star graphs
- Small cutsets in arc-transitive digraphs of prime degree
- Under which conditions is λ″(G)=κ″(L(G)) ?
- Fault tolerability analysis of folded crossed cubes based on \(g\)-component and \(g\)-good neighbor fault pattern
- The super-connectivity of Kneser graphs
- Edge-superconnectivity of semiregular cages with odd girth
- Connectivity and super connectivity of folded hypercube-like networks
- Analysis and synthesis problems for network resilience
- Component conditional fault tolerance of hierarchical folded cubic networks
- Edge-connectivity and edge-superconnectivity in sequence graphs
- Reliability considerations for process network synthesis problems
- Super-connected but not super edge-connected graphs
- Strongly edge triangle regular graphs and a conjecture of Kotzig
- On vosperian and superconnected vertex-transitive digraphs
- Title not available (Why is that?)
- Super-connected and hyper-connected jump graphs
- Reliability analysis of the generalized balanced hypercube
- A new approach to finding the extra connectivity of graphs
- Many-to-many edge-disjoint paths in \((n,k)\)-enhanced hypercube under three link-faulty hypotheses
- Incorporating dependent node damage in deterministic connectivity analysis and synthesis of networks
- Restricted arc connectivity of unidirectional hypercubes and unidirectional folded hypercubes
- Network reliability: Heading out on the highway
- A recursive formula for the reliability of a \(r\)-uniform complete hypergraph and its applications
This page was built for publication: Synthesis of reliable networks - a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3740538)
