ScienceOpen:
research and publishing network
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
My ScienceOpen
Sign in
Register
Dashboard
Blog
About
Search
Advanced search
My ScienceOpen
Sign in
Register
Dashboard
Search
Search
Advanced search
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
Blog
About
0
views
4
references
Top references
cited by
18
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
758
similar
All similar
Record
: found
Abstract
: not found
Article
: not found
A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs
Author(s):
Surender Baswana
,
Sandeep Sen
Publication date
Created:
July 2007
Publication date
(Print):
July 2007
Journal:
Random Structures and Algorithms
Publisher:
Wiley-Blackwell
Read this article at
ScienceOpen
Publisher
Review
Review article
Invite someone to review
Bookmark
Cite as...
There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
Electronic Workshops in Computing (eWiC)
Most cited references
4
Record
: found
Abstract
: not found
Article
: not found
Approximate distance oracles
Mikkel Thorup
,
Uri Zwick
(2005)
0
comments
Cited
81
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Complexity of network synchronization
Baruch Awerbuch
(1985)
0
comments
Cited
59
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
A trade-off between space and efficiency for routing tables
Eli Upfal
,
David Peleg
(1989)
0
comments
Cited
25
times
– based on
0
reviews
Review now
Bookmark
All references
Author and article information
Journal
Title:
Random Structures and Algorithms
Abbreviated Title:
Random Struct. Alg.
Publisher:
Wiley-Blackwell
ISSN (Print):
10429832
ISSN (Electronic):
10982418
Publication date Created:
July 2007
Publication date (Print):
July 2007
Volume
: 30
Issue
: 4
Pages
: 532-563
Article
DOI:
10.1002/rsa.20130
SO-VID:
9386dae8-1e75-43ce-9ca2-b39550acebaa
Copyright ©
© 2007
License:
http://doi.wiley.com/10.1002/tdm_license_1.1
History
Data availability:
Comments
Comment on this article
Sign in to comment
scite_
Similar content
758
The role of boundary spanners in delivering collaborative care: a process evaluation
Authors:
Carianne M. Hunt
,
Michael Spence
,
Anne McBride
Crowding at the frontier: boundary spanners, gatekeepers and knowledge brokers
Authors:
A. HAAS
Free to Be Trusted? Organizational Constraints on Trust in Boundary Spanners
Authors:
Bill McEvily
,
Vincenzo Perrone
,
Akbar Zaheer
See all similar
Cited by
18
On Dynamic Shortest Paths Problems
Authors:
Uri Zwick
,
Liam Roditty
Asymptotically Near-Optimal Planning With Probabilistic Roadmap Spanners
Authors:
Kostas E. Bekris
,
James Marble
Distributed algorithms for ultrasparse spanners and linear size skeletons
Authors:
Seth Pettie
See all cited by
Most referenced authors
16
Noga Alon
David Peleg
David Peleg
See all reference authors