Urmăriți
James A. Knisely
James A. Knisely
Afiliere necunoscută
Adresă de e-mail confirmată pe bju.edu
Titlu
Citat de
Citat de
Anul
Fall colorings of graphs
JE Dunbar, SM Hedetniemi, ST Hedetniemi, DP Jacobs, J Knisely, ...
Journal of Combinatorial Mathematics and Combinatorial Computing 33, 257-274, 2000
572000
Domination subdivision numbers
T Haynes, S Hedetniemi, S Hedetniemi, D Jacobs, J Knisely, ...
Discussiones mathematicae graph theory 21 (2), 239-253, 2001
432001
Secondary domination in graphs
SM Hedetniemi, ST Hedetniemi, J Knisely, DF Rall, TW Haynes
AKCE International Journal of Graphs and Combinatorics 5 (2), 103-115, 2008
372008
A tridiagonal system solver for distributed memory parallel processors with vector nodes
CL Cox, JA Knisely
Journal of Parallel and Distributed Computing 13 (3), 325-331, 1991
191991
The study of cyclic gossiping in graphs
JA Knisely
21993
Broadcasting and gossiping in communication networks
R Laskar, JA Knisely
Applied Mathematical Modeling, 1999
11999
Minimal cyclic broadcast graphs
J Knisely, R Laskar
Congressus Numerantium, 210-214, 1994
11994
Cyclic gossiping times for some classes of graphs
JA Knisely, R Laskar
Networks: An International Journal 28 (3), 135-141, 1996
1996
Implementation of a nonsymmetric cyclic reduction algorithm on a hypercube architecture with vector processors
JA Knisely
1989
Domination Criticality
J Knisely
Sistemul nu poate realiza operația în acest moment. Încercați din nou mai târziu.
Articole 1–10