( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Self-Stabilizing Distributed Algorithm for Strong Matching in a System Graph.

, , , и . HiPC, том 2913 из Lecture Notes in Computer Science, стр. 66-73. Springer, (2003)

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.

T Masselink

T Weber

T Hollemann

T Fauster

T Attin

 

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

Rectilinear Steiner Trees in Rectangle Trees., , и . SIAM J. Algebraic Discret. Methods, 1 (1): 70-81 (1980)Roman 2-domination., , , и . Discret. Appl. Math., (2016)A linear algorithm for disjoint matchings in trees., , и . Discret. Math., 21 (2): 129-136 (1978)Bibliography on domination in graphs and some basic definitions of domination parameters., и . Discret. Math., 86 (1-3): 257-277 (1990)Anonymous Daemon Conversion in Self-stabilizing Algorithms by Randomization in Constant Space., , , и . ICDCN, том 4904 из Lecture Notes in Computer Science, стр. 182-190. Springer, (2008)Determining fastest routes using fixed schedules., и . AFIPS Spring Joint Computing Conference, стр. 1-8. ACM, (1963)Minimum broadcast graphs., , , и . Discret. Math., 25 (2): 189-193 (1979)Disjoint independent dominating sets in graphs., и . Discret. Math., 15 (3): 213-222 (1976)1, 2-sets in graphs., , , и . Discret. Appl. Math., 161 (18): 2885-2893 (2013)Irredundant and perfect neighbourhood sets in trees., , , и . Discret. Math., 188 (1-3): 253-260 (1998)