0
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: not found
      • Article: not found

      A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs

      ,
      Random Structures and Algorithms
      Wiley-Blackwell

      Read this article at

      ScienceOpenPublisher
      Bookmark
          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

          Most cited references4

          • Record: found
          • Abstract: not found
          • Article: not found

          Approximate distance oracles

            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Complexity of network synchronization

              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              A trade-off between space and efficiency for routing tables

                Bookmark

                Author and article information

                Journal
                Random Structures and Algorithms
                Random Struct. Alg.
                Wiley-Blackwell
                10429832
                10982418
                July 2007
                July 2007
                : 30
                : 4
                : 532-563
                Article
                10.1002/rsa.20130
                9386dae8-1e75-43ce-9ca2-b39550acebaa
                © 2007

                http://doi.wiley.com/10.1002/tdm_license_1.1

                History

                Comments

                Comment on this article