( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A compact linear programming formulation of the maximum concurrent flow problem.

, , , и . Networks, 65 (1): 68-87 (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Markus Matula

Carl W David

David W Pao

David W Kuck

Lieselotte Matula

 

Другие публикации лиц с тем же именем

Course and program descriptions.. ACM SIGCSE Bull., 2 (1): 12-15 (1970)A term project given in the basic computer science course at Washington University.. ACM SIGCSE Bull., 1 (4): 16-19 (1969)A feasibility analysis of fixed-slash rational arithmetic., и . IEEE Symposium on Computer Arithmetic, стр. 39-47. IEEE Computer Society, (1978)A feasibility analysis of binary fixed-slash and floating-slash number systems., и . IEEE Symposium on Computer Arithmetic, стр. 29-38. IEEE Computer Society, (1978)Fixed-slash and floating-slash rational arithmetic.. IEEE Symposium on Computer Arithmetic, стр. 90-91. IEEE Computer Society, (1975)Ramsey theory for graph connectivity.. J. Graph Theory, 7 (1): 95-103 (1983)A low power radix-4 dual recoded integer squaring implementation for use in design of application specific arithmetic circuits., , и . ACSCC, стр. 1819-1822. IEEE, (2008)Determining Edge Connectivity in O(nm). FOCS, стр. 249-251. IEEE Computer Society, (1987)Prescaled Integer Division., и . IEEE Symposium on Computer Arithmetic, стр. 63-. IEEE Computer Society, (2003)Bipartite Grid Partitioning of a Random Geometric Graph., и . DCOSS, стр. 163-169. IEEE, (2017)