A new implementation of an algorithm for the optimal assignment problem: An improved version of Munkres' algorithm
From MaRDI portal
Publication:3048271
DOI10.1007/BF01930994zbMath0413.68061MaRDI QIDQ3048271
Publication date: 1979
Published in: BIT (Search for Journal in Brave)
computational complexity; analysis of algorithms; network flow; optimal assignment problem; worst-case time
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
90B10: Deterministic network models in operations research
68R99: Discrete mathematics in relation to computer science
Cites Work