Browse

최단경로 및 최대흐름 문제를 위한 다항시간 단체법에 관한 연구
A Study on the polynomial-time simplex algorithms for the shortest path problem and the maximum flow problem

Cited 0 time in Web of Science Cited 0 time in Scopus
  • mendeley

Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.

Browse