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

      Amortized efficiency of a path retrieval data structure

      Theoretical Computer Science
      Elsevier BV

      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 references5

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

          Amortized Computational Complexity

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

            Worst-case Analysis of Set Union Algorithms

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

              An On-Line Edge-Deletion Problem

                Bookmark

                Author and article information

                Journal
                Theoretical Computer Science
                Theoretical Computer Science
                Elsevier BV
                03043975
                1986
                1986
                : 48
                :
                : 273-281
                Article
                10.1016/0304-3975(86)90098-8
                ce43e61b-f82d-4b31-a370-d31b19357d38
                © 1986

                http://www.elsevier.com/tdm/userlicense/1.0/

                History

                Comments

                Comment on this article