Toggle navigation
Publications
Researchers
Institutions
0
Sign In
Federated Authentication
(Click on the image)
Local Sign In
Password Recovery
Register
Sign In
Publications
Search
Statistics
A Fast Algorithm for Computing Minimum Routing Cost Spanning Trees
AuthID
P-003-T9A
2
Author(s)
Campos, R
·
Ricardo, M
Document Type
Article
Year published
2008
Published
in
COMPUTER NETWORKS,
ISSN: 1389-1286
Volume: 52, Issue: 17, Pages: 3229-3247 (19)
Indexing
Wos
®
Scopus
®
Dblp
®
/en/publications/view/125226
Crossref
®
20
Google Scholar
®
Metadata
Sources
Publication Identifiers
DOI
:
10.1016/j.comnet.2008.08.013
DBLP
: journals/cn/CamposR08
SCOPUS
: 2-s2.0-54049155640
Wos
: WOS:000261246600004
Source Identifiers
ISSN
: 1389-1286
Export Publication Metadata
Export
×
Publication Export Settings
BibTex
EndNote
APA
Export Preview
Marked List
Add to Marked List
Info
At this moment we don't have any links to full text documens.
×
Select Source
This publication has:
2 records from
ISI
2 records from
SCOPUS
2 records from
DBLP
2 records from
Unpaywall
2 records from
Openlibrary
2 records from
Handle
Please select which records must be used by Authenticus!
×
Preview Publications
© 2024 CRACS & Inesc TEC - All Rights Reserved
Privacy Policy
|
Terms of Service