Closest paths in graph drawings under an elastic metric
DOI10.2478/amcs-2018-0029zbMath1475.05120OpenAlexW2883777747WikidataQ129558877 ScholiaQ129558877MaRDI QIDQ1784072
Publication date: 26 September 2018
Published in: International Journal of Applied Mathematics and Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2478/amcs-2018-0029
Analysis of algorithms and problem complexity (68Q25) Dynamic programming (90C39) Pattern recognition, speech recognition (68T10) Graph algorithms (graph-theoretic aspects) (05C85) Machine vision and scene understanding (68T45) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- Content-based image retrieval using a signature graph and a self-organizing map
- Functional and shape data analysis
- On shape of plane elastic curves
- Riemannian geometries on spaces of plane curves
- Nuclei segmentation for computer-aided diagnosis of breast cancer
- Welcome to Riemannian Computing in Computer Vision
- A New Geometric Metric in the Space of Curves, and Applications to Tracking Deforming Objects by Prediction and Filtering
- Convex Representations of Graphs
- Statistical Estimation of the Dynamics of Watershed Dams
- The Complexity of Enumeration and Reliability Problems
- Computable Elastic Distances Between Shapes
- Fibonacci heaps and their uses in improved network optimization algorithms
- How to Draw a Graph
This page was built for publication: Closest paths in graph drawings under an elastic metric