The following pages link to (Q4766894):
Displaying 46 items.
- Communication in markets. A suggested approach (Q374798) (← links)
- Nodal interdiction (Q410061) (← links)
- Characterizing (quasi-)ultrametric finite spaces in terms of (directed) graphs (Q444440) (← links)
- Survivable networks, linear programming relaxations and the parsimonious property (Q689117) (← links)
- Polynomial testing of the query ''Is \(a^ b\geq c^ d?''\) with application to finding a minimal cost reliability ratio spanning tree (Q800816) (← links)
- Flow equivalent trees in undirected node-edge-capacitated planar graphs (Q845841) (← links)
- Distance center and centroid of a median graph (Q1092069) (← links)
- Maximum flow and critical cutset as descriptors of multi-state systems with randomly capacitated components (Q1098757) (← links)
- Realizability of p-point graphs with prescribed minimum degree, maximum degree, and point-connectivity (Q1149964) (← links)
- Optimally reliable networks (Q1179730) (← links)
- On-line computation of minimal and maximal length paths (Q1184981) (← links)
- Path delays in communication networks (Q1219114) (← links)
- Optimization problems of transportation in communication networks with variable capacities (Q1743204) (← links)
- Analysis of critical damage in the communication network. I: Model and computational experiment (Q1995357) (← links)
- Analysis of critical damage in the communication network. IV: Multicriteria estimations of cluster vulnerability (Q2134320) (← links)
- Analysis of cluster damages in network systems (Q2206489) (← links)
- The \(\alpha\)-maximum flow model with uncertain capacities (Q2338453) (← links)
- Sensitivity analysis in stochastic flow networks using the Monte Carlo method (Q3141767) (← links)
- Graphs with the smallest number of minimum cut sets (Q3344017) (← links)
- Synthesis of directed multicommodity flow networks (Q3712097) (← links)
- On a function for the vulnerability of a directed flow network (Q3779973) (← links)
- Incorporating dependent node damage in deterministic connectivity analysis and synthesis of networks (Q3786258) (← links)
- The structure of distances in networks (Q3798690) (← links)
- Maximal expected flow in a network subject to arc failures (Q3870689) (← links)
- On the computational complexity of centers locating in a graph (Q3902477) (← links)
- Realizability of <i>p</i>‐point graphs with prescribed minimum degree, maximum degree, and line connectivity (Q3903032) (← links)
- Realizability ofp-point,q-line graphs with prescribed point connectivity, line connectivity, or minimum degree (Q3950581) (← links)
- Maximum flow in networks with a small number of random arc capacities (Q3953537) (← links)
- Efficient algorithms for generalized cut‐trees (Q3978604) (← links)
- Characterizing stochastic flow networks using the monte carlo method (Q3984282) (← links)
- An improved version of the out-of-kilter method and a comparative study of computer codes (Q4073126) (← links)
- A minimum-cost multicommodity network flow problem concerning imports and exports (Q4091734) (← links)
- Maximum flow in probabilistic graphs-the discrete case (Q4108116) (← links)
- A new deterministic network reliability measure (Q4160705) (← links)
- Analyse und Synthese zuverlässiger Netze (Q4196224) (← links)
- A value focused model for a C4 network (Q4520246) (← links)
- Bounds on the mean of the maximum of a number of normal random variables (Q4730537) (← links)
- (Q4730664) (← links)
- Exact calculation of computer network reliability (Q4772718) (← links)
- Topological reversibility and causality in feed-forward networks (Q5135180) (← links)
- Some problems in discrete optimization (Q5636690) (← links)
- Optimal design of centralized computer networks (Q5643888) (← links)
- Routing in computer networks (Q5643889) (← links)
- Lower bounds on the vulnerability of a graph (Q5661540) (← links)
- A sum of disjoint products algorithm for reliability evaluation of flow networks (Q5935396) (← links)
- Network reliability: Heading out on the highway (Q6087070) (← links)
