Efficient algorithms for the reverse shortest path problem on trees under the hamming distance

by Javad Tayyebi, Massoud Aman

Published in Yugoslav Journal of Operations Research by National Library of Serbia.

2017 Volume 27, p46-60

application/pdf 336.3 kB `file_g3mzipkxbzdkhk4ops6xsp6buy`	yujor.fon.bg.ac.rs (web) web.archive.org (webarchive)
application/pdf 336.3 kB `file_7nfgzyhjibhztbnvzdwepwgesi`	web.archive.org (webarchive) elib.mi.sanu.ac.rs (web)

Preserved and Accessible

Type article-journal
Stage

published

Year 2017
Language en ^?

DOI 10.2298/yjor150624009t

Journal Metadata
Open Access Publication
In DOAJ
Not in Keepers Registry
ISSN-L: 0354-0243

Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)

Cite This

BibTeX
CSL-JSON
MLA
Harvard

Lookup Links

oaDOI/unpaywall (OA fulltext)
Crossref Metadata (via API)
Worldcat
SHERPA/RoMEO (journal policies)
wikidata.org
CORE.ac.uk
Semantic Scholar
Google Scholar

Catalog Record
Revision: d49138ea-f39f-4e4c-bdeb-dff030e132cb
API URL: JSON

Efficient algorithms for the reverse shortest path problem on trees under the hamming distance release_laz5klkcf5bs7h7l4kbp44d4iy