( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Characterizing bit permutation networks.

, , и . Networks, 33 (4): 261-267 (1999)

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.

Gerard J Docherty

Fu-Chang Chang

Gerard Meijer

Gérard Gäfgen

Walter Gérard

 

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

The L(2, 1)-Labeling Problem on Graphs., и . SIAM J. Discret. Math., 9 (2): 309-316 (1996)Edge Roman Domination on Graphs., , и . Graphs Comb., 32 (5): 1731-1747 (2016)A finiteness theorem for maximal independent sets., , , и . Graphs Comb., 12 (1): 321-326 (1996)Minimum Span of No-Hole (r+1)-Distant Colorings., , и . SIAM J. Discret. Math., 14 (3): 370-380 (2001)Diagonal and Pandiagonal Tournament Latin Squares., и . Eur. J. Comb., 6 (2): 149-155 (1985)The upper bound on k-tuple domination numbers of graphs.. Eur. J. Comb., 29 (5): 1333-1336 (2008)A Linear-Time Algorithm for Finding Locally Connected Spanning Trees on Circular-Arc Graphs., , и . Algorithmica, 66 (2): 369-396 (2013)The Profile Minimization Problem in Trees., и . SIAM J. Comput., 23 (1): 71-81 (1994)Locally connected spanning trees on graphs, , и . CoRR, (2004)Consecutive Edge-Colorings of Generalized θ-Graphs., и . CGGA, том 7033 из Lecture Notes in Computer Science, стр. 214-225. Springer, (2010)