Computing geodesic furthest neighbors in simple polygons
Journal of Computer and System Sciences
Superextensions and the depth of median graphs
Journal of Combinatorial Theory Series A
Medians and centres of polyominoes
Information Processing Letters
Matrix Searching with the Shortest-Path Metric
SIAM Journal on Computing
Discrete Applied Mathematics
Decomposition and l1-embedding of weakly median graphs
European Journal of Combinatorics
Median problem in some plane triangulations and quadrangulations
Computational Geometry: Theory and Applications
The lattice dimension of a graph
European Journal of Combinatorics
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Recognizing partial cubes in quadratic time
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Discrete Applied Mathematics
Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs
Proceedings of the twenty-fourth annual symposium on Computational geometry
Center stable matchings and centers of cover graphs of distributive lattices
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Combinatorics and Geometry of Finite and Infinite Squaregraphs
SIAM Journal on Discrete Mathematics
Shortest path problem in rectangular complexes of global nonpositive curvature
Computational Geometry: Theory and Applications
Fast approximation algorithms for the diameter and radius of sparse graphs
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
In this note, we present first linear time algorithms for computing the center and the diameter of several classes of face regular plane graphs: triangulations with inner vertices of degree ≥ 6, quadrangulations with inner vertices of degree ≥ 4 and the subgraphs of the regular hexagonal grid bounded by a simple circuit of this grid.