𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Medians and centres of polyominoes

✍ Scribed by Yves Métivier; Nasser Saheb


Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
583 KB
Volume
57
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


Medians of polyominoes: A property for r
✍ E. Barcucci; A. Del Lungo; M. Nivat; R. Pinzani 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 273 KB

In a previous report, we studied the problem of recon-Kuba's heuristic algorithm [7] reconstructs some convex sets. structing a discrete set S from its horizontal and vertical projections. Some of the properties imposed on the sets eliminate all ambigu- We defined an algorithm that decides whether

Medians of arbitrary graphs
✍ Peter J. Slater 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 165 KB

## Abstract For each vertex __u__ in a connected graph __H__, the __distance__ of __u__ is the sum of the distances from __u__ to each of the vertices __v__ of __H.__ A vertex of minimum distance in __H__ is called a __median__ vertex. It is shown that for any graph __G__ there exists a graph __H__