( en | de | ru )

 

Disambiguation of "Chang, Gerard J."

Author of the publication

copydeleteadd this publication to your clipboard
Node-disjoint paths in hierarchical hypercube networks.

, , , and . Inf. Sci., 177 (19): 4200-4207 (2007)

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. You can also use the button next to the name to display some publications already assigned to the person.

Gerard J Docherty

Fu-Chang Chang

Gerard Meijer

Gérard Gäfgen

Gerard Spettel

 

Other publications of authors with the same name

No-hole 2-distant colorings for unit interval graphs., , and . Ars Comb., (2001)Characterizing bit permutation networks., , and . Networks, 33 (4): 261-267 (1999)The Profile Minimization Problem in Trees., and . SIAM J. Comput., 23 (1): 71-81 (1994)The upper bound on k-tuple domination numbers of graphs.. Eur. J. Comb., 29 (5): 1333-1336 (2008)Diagonal and Pandiagonal Tournament Latin Squares., and . Eur. J. Comb., 6 (2): 149-155 (1985)Pseudo-Hamiltonian-connected graphs., and . Discret. Appl. Math., 100 (3): 145-153 (2000)The weighted independent domination problem is NP-complete for chordal graphs.. Discret. Appl. Math., 143 (1-3): 351-352 (2004)k-Subdomination in graphs., , and . Discret. Appl. Math., 120 (1-3): 55-60 (2002)Consecutive Edge-Colorings of Generalized θ-Graphs., and . CGGA, volume 7033 of Lecture Notes in Computer Science, page 214-225. Springer, (2010)Node-disjoint paths in hierarchical hypercube networks., , and . IPDPS, IEEE, (2006)