scientific article; zbMATH DE number 3441964

zbMath0281.94012MaRDI QIDQ4766894

I. T. Frisch, Howard Frank

Publication date: 1971

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Related Items (46)

Analysis of critical damage in the communication network. IV: Multicriteria estimations of cluster vulnerability ⋮ Synthesis of directed multicommodity flow networks ⋮ Distance center and centroid of a median graph ⋮ Efficient algorithms for generalized cut‐trees ⋮ Flow equivalent trees in undirected node-edge-capacitated planar graphs ⋮ Characterizing stochastic flow networks using the monte carlo method ⋮ Maximum flow and critical cutset as descriptors of multi-state systems with randomly capacitated components ⋮ Communication in markets. A suggested approach ⋮ Some problems in discrete optimization ⋮ Optimal design of centralized computer networks ⋮ Routing in computer networks ⋮ Network reliability: Heading out on the highway ⋮ Nodal interdiction ⋮ Unnamed Item ⋮ Realizability of p-point graphs with prescribed minimum degree, maximum degree, and point-connectivity ⋮ Lower bounds on the vulnerability of a graph ⋮ On a function for the vulnerability of a directed flow network ⋮ Analysis of cluster damages in network systems ⋮ Incorporating dependent node damage in deterministic connectivity analysis and synthesis of networks ⋮ Characterizing (quasi-)ultrametric finite spaces in terms of (directed) graphs ⋮ An improved version of the out-of-kilter method and a comparative study of computer codes ⋮ The structure of distances in networks ⋮ Topological reversibility and causality in feed-forward networks ⋮ Optimally reliable networks ⋮ On-line computation of minimal and maximal length paths ⋮ On the computational complexity of centers locating in a graph ⋮ A minimum-cost multicommodity network flow problem concerning imports and exports ⋮ Optimization problems of transportation in communication networks with variable capacities ⋮ Maximum flow in probabilistic graphs-the discrete case ⋮ Analysis of critical damage in the communication network. I: Model and computational experiment ⋮ Survivable networks, linear programming relaxations and the parsimonious property ⋮ A sum of disjoint products algorithm for reliability evaluation of flow networks ⋮ Path delays in communication networks ⋮ Graphs with the smallest number of minimum cut sets ⋮ A value focused model for a C4 network ⋮ Maximal expected flow in a network subject to arc failures ⋮ A new deterministic network reliability measure ⋮ Realizability of p‐point graphs with prescribed minimum degree, maximum degree, and line connectivity ⋮ Analyse und Synthese zuverlässiger Netze ⋮ Bounds on the mean of the maximum of a number of normal random variables ⋮ The \(\alpha\)-maximum flow model with uncertain capacities ⋮ Polynomial testing of the query Is \(a^ b\geq c^ d?\) with application to finding a minimal cost reliability ratio spanning tree ⋮ Realizability ofp-point,q-line graphs with prescribed point connectivity, line connectivity, or minimum degree ⋮ Sensitivity analysis in stochastic flow networks using the Monte Carlo method ⋮ Maximum flow in networks with a small number of random arc capacities ⋮ Exact calculation of computer network reliability

This page was built for publication: