A quick MST-based algorithm to obtain pathfinder networks (∞, n - 1)

Literals

dcterms:creator
- Quirin A.
dcterms:contributor
- Quirin, A., Cordón, O., Guerrero-Bote, V.P., Vargas-Quesada, B., Moya-Anegón, F.
ou:bibtex
- @article{Guerrero-Bote2008,title = {A quick MST-based algorithm to obtain pathfinder networks (?, n - 1)},journal = {Journal of the American Society for Information Science and Technology},year = {2008},volume = {59},number = {12},pages = {1912-1924},author = {Quirin, A. and Cord{\'o}n, O. and Guerrero-Bote, V.P. and Vargas-Quesada, B. and Moya-Aneg{\'o}n, F.}}
dcterms:publisher
- Journal of the American Society for Information Science and Technology
ou:eid
- 2-s2.0-53849138795
bibo:doi
- 10.1002/asi.20904
bibo:page_range
- 1912-1924
bibo:issn
- 1532-2882
fabio:hasPublicationYear
- 2008
vivo:identifier
- 2008-422
bibo:eissn
- 1532-2890
ou:tipoPublicacion
- Article
dcterms:title
- A quick MST-based algorithm to obtain pathfinder networks (∞, n - 1)
vcard:url
- https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=53849138795&origin=inward
ou:urlOrcid
- http://www.scopus.com/inward/record.url?eid=2-s2.0-53849138795&partnerID=MN8TOARS
ou:urlScopus
- https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=53849138795&origin=inward
bibo:volume
- 59