A Polynomial Time Algorithm to Compute Geodesics in CAT(0) Cubical Complexes-Reference-Cited by-同舟云学术

A Polynomial Time Algorithm to Compute Geodesics in CAT(0) Cubical Complexes

Published:2019-11-27 Issue:3 Volume:65 Page:636-654
ISSN:0179-5376
Container-title:Discrete & Computational Geometry
language:en
Short-container-title:Discrete Comput Geom

Author:

Hayashi Koyo

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/s00454-019-00154-2.pdf

Reference27 articles.

1. Abrams, A., Ghrist, R.: State complexes for metamorphic robots. Int. J. Robot. Res. 23(7–8), 811–826 (2004)

2. Ardila, F., Owen, M., Sullivant, S.: Geodesics in CAT(0) cubical complexes. Adv. Appl. Math. 48(1), 142–163 (2012)

3. Bačák, M.: Convex Analysis and Optimization in Hadamard Spaces. De Gruyter Series in Nonlinear Analysis and Applications, vol. 22. De Gruyter, Berlin (2014)

4. Bandelt, H.-J., Chepoi, V.: Metric graph theory and geometry: a survey. In: Goodman, J.E., Pach, J., Pollack, R. (eds.) Surveys on Discrete and Computational Geometry: Twenty Years Later. Contemporary Mathematics, vol. 453, pp. 49–86. American Mathematical Society, Providence (2008)

5. Bandelt, H.-J., Forster, P., Röhl, A.: Median-joining networks for inferring intraspecific phylogenies. Mol. Biol. Evol. 16(1), 37–48 (1999)

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Medians in median graphs and their cube complexes in linear time;Journal of Computer and System Sciences;2022-06

2. A nonpositive curvature property of modular semilattices;Geometriae Dedicata;2021-04-26

3. Computing the nc-Rank via Discrete Convex Optimization on CAT(0) Spaces;SIAM Journal on Applied Algebra and Geometry;2021-01