✦ LIBER ✦

Connected components of arithmetic graphs

✍ Scribed by Melvyn B. Nathanson

Publisher: Springer Vienna
Year: 1980
Tongue: English
Weight: 176 KB
Volume: 89
Category: Article
ISSN: 0026-9255
DOI: 10.1007/bf01295437

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Connected components of graphs and rever

Connected components of graphs and reverse mathematics

✍ Jeffry L. Hirst 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 644 KB

Max-min partitioning of grid graphs into

Max-min partitioning of grid graphs into connected components

✍ Becker, Ronald; Lari, Isabella; Lucertini, Mario; Simeone, Bruno 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 197 KB 👁 2 views

The partitioning of a rectangular grid graph with weighted vertices into p connected components such that the component of smallest weight is as heavy as possible (the max-min problem) is considered. It is shown that the problem is NP-hard for rectangles with at least three rows. A shifting algorith

Reconstructing then-connected-components

Reconstructing then-connected-components of a graph

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

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

Geometry of arithmetic graphs

✍ Yu. G. Grigor'yan 📂 Article 📅 1983 🏛 Springer US 🌐 English ⚖ 504 KB

Connected Components in Random Graphs wi

Connected Components in Random Graphs with Given Expected Degree Sequences

✍ Fan Chung; Linyuan Lu 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 158 KB