Analyse und Synthese zuverlässiger Netze
From MaRDI portal
Publication:4196224
DOI10.1007/BF01954689zbMath0408.90035MaRDI QIDQ4196224
Publication date: 1979
Published in: Zeitschrift für Operations Research (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Reliability, availability, maintenance, inspection in operations research (90B25) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Applications of graph theory to circuits and networks (94C15)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Flow variation in multiple min-cut calculations
- Multi-Terminal Network Flows
- Disjoint paths in a network
- Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
- A Vertex Elimination Algorithm for Enumerating all Simple Paths in a Graph
- On minimum multigraphs with prescribed lower bounds on local line connectivities
- A Method for Calculation of Network Reliability
- Synthesis of Available Networks
- A fast algorithm for reliability calculations in sparse networks
- Line removal algorithms for graphs and their degree lists
- Deterministic network optimization: A bibliography
- Transformations for simplifying network reliability calculations
- On optimum path problems
- Computing the Reliability of Complex Networks
- A new deterministic network reliability measure
- A Recursive Method Based on Case Analysis for Computing Network Terminal Reliability
- New Topological Formula and Rapid Algorithm for Reliability Analysis of Complex Networks
- A theorem on n-connected graphs
- The Two-Triangle Case of the Acquaintance Graph
- Network reliability analysis: Part I
- A general class of invulnerable graphs
- Existence of k-edge connected ordinary graphs with prescribed degrees
This page was built for publication: Analyse und Synthese zuverlässiger Netze
