A correction on Shiloach's algorithm for minimum linear arrangement of trees

More than 30 years ago, Shiloach published an algorithm to solve the minimum linear arrangement problem for undirected trees. Here we fix a small error in the original version of the algorithm and discuss its effect on subsequent literature. We also improve some aspects of the notation.

Detalhes bibliográficos
Autores: Esteban Ángeles, Juan Luis|||0000-0003-0072-6576, Ferrer Cancho, Ramon|||0000-0002-7820-923X
Formato: artículo
Fecha de publicación:2017
País:España
Recursos:Universitat Politècnica de Catalunya (UPC)
Repositorio:UPCommons. Portal del coneixement obert de la UPC
Idioma:inglés
OAI Identifier:oai:upcommons.upc.edu:2117/106035
Acesso em linha:https://hdl.handle.net/2117/106035
https://dx.doi.org/10.1137/15M1046289
Access Level:acceso abierto
Palavra-chave:Shiloach’s algorithm
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica::Algorísmica i teoria de la complexitat
id ES_2ccf55ea05fa12cba35fa05a79703679
oai_identifier_str oai:upcommons.upc.edu:2117/106035
network_acronym_str ES
network_name_str España
repository_id_str
spelling A correction on Shiloach's algorithm for minimum linear arrangement of treesEsteban Ángeles, Juan Luis|||0000-0003-0072-6576Ferrer Cancho, Ramon|||0000-0002-7820-923XShiloach’s algorithmÀrees temàtiques de la UPC::Informàtica::Informàtica teòrica::Algorísmica i teoria de la complexitatMore than 30 years ago, Shiloach published an algorithm to solve the minimum linear arrangement problem for undirected trees. Here we fix a small error in the original version of the algorithm and discuss its effect on subsequent literature. We also improve some aspects of the notation.20172017-06-2920172017-06-30journal articlehttp://purl.org/coar/resource_type/c_6501AMhttp://purl.org/coar/version/c_ab4af688f83e57aainfo:eu-repo/semantics/articleapplication/pdfhttps://hdl.handle.net/2117/106035https://dx.doi.org/10.1137/15M1046289reponame:UPCommons. Portal del coneixement obert de la UPCinstname:Universitat Politècnica de Catalunya (UPC)Inglésengopen accesshttp://purl.org/coar/access_right/c_abf2info:eu-repo/semantics/openAccessoai:upcommons.upc.edu:2117/1060352026-05-27T15:37:01Z
dc.title.none.fl_str_mv A correction on Shiloach's algorithm for minimum linear arrangement of trees
title A correction on Shiloach's algorithm for minimum linear arrangement of trees
spellingShingle A correction on Shiloach's algorithm for minimum linear arrangement of trees
Esteban Ángeles, Juan Luis|||0000-0003-0072-6576
Shiloach’s algorithm
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica::Algorísmica i teoria de la complexitat
title_short A correction on Shiloach's algorithm for minimum linear arrangement of trees
title_full A correction on Shiloach's algorithm for minimum linear arrangement of trees
title_fullStr A correction on Shiloach's algorithm for minimum linear arrangement of trees
title_full_unstemmed A correction on Shiloach's algorithm for minimum linear arrangement of trees
title_sort A correction on Shiloach's algorithm for minimum linear arrangement of trees
dc.creator.none.fl_str_mv Esteban Ángeles, Juan Luis|||0000-0003-0072-6576
Ferrer Cancho, Ramon|||0000-0002-7820-923X
author Esteban Ángeles, Juan Luis|||0000-0003-0072-6576
author_facet Esteban Ángeles, Juan Luis|||0000-0003-0072-6576
Ferrer Cancho, Ramon|||0000-0002-7820-923X
author_role author
author2 Ferrer Cancho, Ramon|||0000-0002-7820-923X
author2_role author
dc.subject.none.fl_str_mv Shiloach’s algorithm
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica::Algorísmica i teoria de la complexitat
topic Shiloach’s algorithm
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica::Algorísmica i teoria de la complexitat
description More than 30 years ago, Shiloach published an algorithm to solve the minimum linear arrangement problem for undirected trees. Here we fix a small error in the original version of the algorithm and discuss its effect on subsequent literature. We also improve some aspects of the notation.
publishDate 2017
dc.date.none.fl_str_mv 2017
2017-06-29
2017
2017-06-30
dc.type.none.fl_str_mv journal article
http://purl.org/coar/resource_type/c_6501
AM
http://purl.org/coar/version/c_ab4af688f83e57aa
dc.type.openaire.fl_str_mv info:eu-repo/semantics/article
format article
dc.identifier.none.fl_str_mv https://hdl.handle.net/2117/106035
https://dx.doi.org/10.1137/15M1046289
url https://hdl.handle.net/2117/106035
https://dx.doi.org/10.1137/15M1046289
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
dc.rights.openaire.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv open access
http://purl.org/coar/access_right/c_abf2
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:UPCommons. Portal del coneixement obert de la UPC
instname:Universitat Politècnica de Catalunya (UPC)
instname_str Universitat Politècnica de Catalunya (UPC)
reponame_str UPCommons. Portal del coneixement obert de la UPC
collection UPCommons. Portal del coneixement obert de la UPC
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869405266746802176
score 15,300719

Registos relacionados