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

      An Efficient Implementation of a Scaling Minimum-Cost Flow Algorithm

      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

          A new approach to the maximum-flow problem

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

            Algorithm 360: shortest-path forest with topological ordering [H]

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

              A strongly polynomial minimum cost circulation algorithm

              Eva Tardos (1985)
                Bookmark

                Author and article information

                Journal
                Journal of Algorithms
                Journal of Algorithms
                Elsevier BV
                01966774
                January 1997
                January 1997
                : 22
                : 1
                : 1-29
                Article
                10.1006/jagm.1995.0805
                9abdf037-59d7-4a31-9a62-042ff5905629
                © 1997

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

                History

                Comments

                Comment on this article