Skip to content
Publish & Distribute
Publishing Solutions
Distribution Solutions
Library Services
Subjects
Architecture and Design
Arts
Business and Economics
Chemistry
Classical and Ancient Near Eastern Studies
Computer Sciences
Cultural Studies
Engineering
General Interest
Geosciences
History
Industrial Chemistry
Jewish Studies
Law
Library and Information Science, Book Studies
Life Sciences
Linguistics and Semiotics
Literary Studies
Materials Sciences
Mathematics
Medicine
Music
Pharmacy
Philosophy
Physics
Social Sciences
Sports and Recreation
Theology and Religion
Publications
Journals
Books
Proceedings
Publishers
Journal Matcher
Blog
Contact
Search
English
English
Deutsch
Polski
Español
Français
Italiano
Cart
Home
Journals
International Journal of Applied Mathematics and Computer Science
Volume 28 (2018): Issue 2 (June 2018)
Open Access
Closest Paths in Graph Drawings under an Elastic Metric
Mateusz Baran
Mateusz Baran
Faculty of Physics, Mathematics and Computer Science Cracow University of Technology, ul. Warszawska 24, 31-155
Kraków, Poland
Search for this author on
Sciendo
|
Google Scholar
Baran, Mateusz
Jun 29, 2018
International Journal of Applied Mathematics and Computer Science
Volume 28 (2018): Issue 2 (June 2018)
About this article
Previous Article
Next Article
Abstract
References
Authors
Articles in this Issue
Preview
PDF
Cite
Share
Download Cover
Published Online:
Jun 29, 2018
Page range:
387 - 397
Received:
May 15, 2017
Accepted:
Nov 19, 2017
DOI:
https://doi.org/10.2478/amcs-2018-0029
Keywords
elastic shape analysis
,
pattern recognition
,
superpixel segmentation
© 2018 Mateusz Baran, published by Sciendo
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.
