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

      Maintenance of a minimum spanning forest in a dynamic plane graph

      , , , , ,
      Journal of Algorithms
      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 references16

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

          Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms

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

            Efficient Planarity Testing

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

              Self-adjusting binary search trees

                Bookmark

                Author and article information

                Journal
                Journal of Algorithms
                Journal of Algorithms
                Elsevier BV
                01966774
                March 1992
                March 1992
                : 13
                : 1
                : 33-54
                Article
                10.1016/0196-6774(92)90004-V
                671ffd86-b198-4228-a51b-19f3071d9130
                © 1992

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

                History

                Comments

                Comment on this article