A fast algorithm for computing minimum routing cost spanning trees
A fast algorithm for computing minimum routing cost spanning trees
dc.contributor.author | Rui Lopes Campos | en |
dc.contributor.author | Manuel Ricardo | en |
dc.date.accessioned | 2017-11-17T10:08:56Z | |
dc.date.available | 2017-11-17T10:08:56Z | |
dc.date.issued | 2008 | en |
dc.description.abstract | en | |
dc.identifier.uri | http://repositorio.inesctec.pt/handle/123456789/3081 | |
dc.language | eng | en |
dc.relation | 4473 | en |
dc.relation | 651 | en |
dc.rights | info:eu-repo/semantics/embargoedAccess | en |
dc.title | A fast algorithm for computing minimum routing cost spanning trees | en |
dc.type | article | en |
dc.type | Publication | en |