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

      A shortest augmenting path algorithm for dense and sparse linear assignment problems

      ,
      Computing
      Springer Nature

      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

          Author and article information

          Journal
          Computing
          Computing
          Springer Nature
          0010-485X
          1436-5057
          December 1987
          December 1987
          : 38
          : 4
          : 325-340
          Article
          10.1007/BF02278710
          f2ed2b18-6c88-4cc7-ab01-e8448a2e624d
          © 1987
          History

          Comments

          Comment on this article