Computing a median point of a simple rectilinear polygon
Information Processing Letters
The Median Procedure in a Formal Theory of Consensus
SIAM Journal on Discrete Mathematics
Medians and centres of polyominoes
Information Processing Letters
Dynamic and static algorithms for optimal placement of resources in a tree
Theoretical Computer Science
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Information Processing Letters
A self-stabilizing distributed algorithm to find the median of a tree graph
Journal of Computer and System Sciences
Self-Stabilizing Algorithms for Finding Centers and Medians of Trees
SIAM Journal on Computing
Regular Article: Graphs of Some CAT(0) Complexes
Advances in Applied Mathematics
Decomposition and l1-embedding of weakly median graphs
European Journal of Combinatorics
Center and diameter problems in plane triangulations and quadrangulations
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
SIAM Journal on Discrete Mathematics
Fast approximations for sums of distances, clustering and the Fermat--Weber problem
Computational Geometry: Theory and Applications
A self-stabilizing algorithm for the median problem in partial rectangular grids and their relatives
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Combinatorics and Geometry of Finite and Infinite Squaregraphs
SIAM Journal on Discrete Mathematics
Hi-index | 0.00 |
In this note, we present linear-time algorithms for computing the median set of plane triangulations with inner vertices of degree ≥ 6 and median vertices of plane quadrangulations with inner vertices of degree ≥ 4.