Closest paths in graph drawings under an elastic metric
DOI10.2478/AMCS-2018-0029zbMATH Open1475.05120OpenAlexW2883777747WikidataQ129558877 ScholiaQ129558877MaRDI QIDQ1784072FDOQ1784072
Authors: M. Baran 
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
Recommendations
Pattern recognition, speech recognition (68T10) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Dynamic programming (90C39) Graph representations (geometric and intersection representations, etc.) (05C62) Machine vision and scene understanding (68T45)
Cites Work
- Functional and shape data analysis
- Riemannian geometries on spaces of plane curves
- Title not available (Why is that?)
- Computable Elastic Distances Between Shapes
- A note on two problems in connexion with graphs
- Fibonacci heaps and their uses in improved network optimization algorithms
- The Complexity of Enumeration and Reliability Problems
- A new geometric metric in the space of curves, and applications to tracking deforming objects by prediction and filtering
- Title not available (Why is that?)
- On shape of plane elastic curves
- How to Draw a Graph
- Content-based image retrieval using a signature graph and a self-organizing map
- Convex Representations of Graphs
- Statistical Estimation of the Dynamics of Watershed Dams
- Nuclei segmentation for computer-aided diagnosis of breast cancer
- Welcome to Riemannian computing in computer vision
Cited In (3)
This page was built for publication: Closest paths in graph drawings under an elastic metric
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1784072)
