( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A decomposition of the matroids with the max-flow min-cut property.

, и . Discret. Appl. Math., 15 (2-3): 329-364 (1986)

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.

Maria Truemper

Josef Kläusler

Jürgen Klausing

Horst Klausing

Siegfried Klausnitzer

 

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

The Needles-in-Haystack Problem., и . MLDM, том 5632 из Lecture Notes in Computer Science, стр. 516-524. Springer, (2009)Polynomial algorithms for a class of linear programs., , и . Math. Program., 21 (1): 121-136 (1981)Optimal flows in nonlinear gain networks.. Networks, 8 (1): 17-36 (1978)A decomposition of the matroids with the max-flow min-cut property., и . Discret. Appl. Math., 15 (2-3): 329-364 (1986)Max-Flow Min-Cut Matroids: Polynomial Testing and Polynomial Algorithms for Maximum Flow and Shortest Routes.. Math. Oper. Res., 12 (1): 72-96 (1987)Improved Comprehensibility and Reliability of Explanations via Restricted Halfspace Discretization.. MLDM, том 5632 из Lecture Notes in Computer Science, стр. 1-15. Springer, (2009)FasTraC: A Decentralized Traffic Control System Based on Logic Programming., , и . CADE, том 1104 из Lecture Notes in Computer Science, стр. 216-220. Springer, (1996)The Complexity of Futile Questioning., и . FCS, стр. 132-138. CSREA Press, (2007)A decomposition theory for matroids. VI. Almost regular matroids.. J. Comb. Theory, Ser. B, 55 (2): 253-301 (1992)A decomposition theory for matroids. II. Minimal violation matroids.. J. Comb. Theory, Ser. B, 39 (3): 282-297 (1985)