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
✦ 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
Group centre and group median of a netwo
✍
S.K. Gupta; A.P. Punnen
📂
Article
📅
1989
🏛
Elsevier Science
🌐
English
⚖ 250 KB
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__
Lorenz ordering of means and medians
✍
Barry C. Arnold; Jose A. Villaseñor
📂
Article
📅
1986
🏛
Elsevier Science
🌐
English
⚖ 214 KB
Tests of homogeneity and trend with medi
✍
Thakur, Ajit K.
📂
Article
📅
1985
🏛
Wiley (John Wiley & Sons)
⚖ 360 KB
Conditional centers and medians of a gra
✍
Edward Minieka
📂
Article
📅
1980
🏛
John Wiley and Sons
🌐
English
⚖ 454 KB