( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Fishman's sampling plan for computing network reliability.

, , , и . IEEE Trans. Reliability, 50 (1): 41-46 (2001)

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.

Francesco Bettella

Protein secondary structure prediction using optimized scoring functions: a comparative statistical method. FU Berlin, (2009)

Francesco Solimena

Francesco Pinosa

Francesco Knechtli

Francesco Borgosano

 

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

Efficient Edge-Swapping Heuristics for Finding Minimum Fundamental Cycle Bases., , , и . WEA, том 3059 из Lecture Notes in Computer Science, стр. 14-29. Springer, (2004)On Minimum Changeover Cost Arborescences., , и . SEA, том 6630 из Lecture Notes in Computer Science, стр. 112-123. Springer, (2011)The k best spanning arborescences of a network., , и . Networks, 10 (2): 91-109 (1980)Approximability of hard combinatorial optimization problems: an introduction., и . Ann. Oper. Res., 96 (1-4): 221-236 (2000)A tree partitioning dynamic policy for OVSF codes assignment in wideband CDMA., , и . IEEE Trans. Wirel. Commun., 3 (4): 1013-1017 (2004)Random Pseudo-Polynomial Algorithms for Exact Matroid Problems., , и . J. Algorithms, 13 (2): 258-273 (1992)Preface., и . Discret. Appl. Math., 42 (2): 119 (1993)Minimum cut bases in undirected networks., , , и . Discret. Appl. Math., 158 (4): 277-290 (2010)On the complexity of finding multi-constrained spanning trees., , и . Discret. Appl. Math., 5 (1): 39-50 (1983)Solving minimum K-cardinality cut problems in planar graphs., , и . Networks, 48 (4): 195-208 (2006)