✦ LIBER ✦

Dynamic location problems with radial structure of the components of the connecting graph

✍ Scribed by A. B. Boronin; O. Yu. Pershin

Publisher: Springer US
Year: 1988
Tongue: English
Weight: 815 KB
Volume: 24
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01082609

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Reconstructing the n-connected component

Reconstructing the n-connected components of a graph

✍ D. L. Greenwell; R. L. Hemminger 📂 Article 📅 1973 🏛 Springer 🌐 English ⚖ 158 KB

A problem of the theory of graphs, conne

A problem of the theory of graphs, connected with random fields

✍ M.D. Shklover 📂 Article 📅 1970 🏛 Elsevier Science ⚖ 359 KB

The structure of quasi 4-connected graph

The structure of quasi 4-connected graphs

✍ Themistocles Politof; A. Satyanarayana 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 646 KB

A minimal point disconnecting set S of a graph G is a nontrivial m-separator, where m = IS I, if the connected components of G -S can be partitioned into two subgraphs each of which has at least two points. A 3-connected graph is quasi 4-connected if it has no nontrivial 3separators. This paper prov

An extremal problem on the connectivity

An extremal problem on the connectivity of graphs

✍ Qi-Mei He 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 401 KB

Successive and structural decomposition

Successive and structural decomposition for the solution of the dynamic plant location problem

✍ A. P. Uzdemir 📂 Article 📅 1984 🏛 Springer US 🌐 English ⚖ 680 KB

On the Structure of 3-connected Matroids

On the Structure of 3-connected Matroids and Graphs

✍ James Oxley; Haidong Wu 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 249 KB

An element e of a 3-connected matroid M is essential if neither the deletion M\e nor the contraction M/e is 3-connected. Tutte's Wheels and Whirls Theorem proves that the only 3-connected matroids in which every element is essential are the wheels and whirls. In this paper, we consider those 3-conne