Sandra Mitchell Hedetniemi, Sandra L Mitchell
Sandra Mitchell Hedetniemi, Sandra L Mitchell
Professor of Computer Science, Clemson University
Verified email at cs.clemson.edu
Title
Cited by
Cited by
Year
A survey of gossiping and broadcasting in communication networks
SM Hedetniemi, ST Hedetniemi, AL Liestman
Networks 18 (4), 319-349, 1988
15931988
Roman domination in graphs
EJ Cockayne, PA Dreyer Jr, SM Hedetniemi, ST Hedetniemi
Discrete Mathematics 278 (1-3), 11-22, 2004
4202004
Domination in graphs applied to electric power networks
TW Haynes, SM Hedetniemi, ST Hedetniemi, MA Henning
SIAM journal on discrete mathematics 15 (4), 519-529, 2002
2962002
Edge domination in trees
S Mitchell, ST Hedetniemi
Proc. of the 8th Southeastern Conference on Combinatorics, Graph Theory and …, 1977
2021977
Constant time generation of rooted trees
T Beyer, SM Hedetniemi
SIAM Journal on Computing 9 (4), 706-712, 1980
1721980
Minimum broadcast graphs
AM Farley, S Hedetniemi, S Mitchell, A Proskurowski
Discrete Math 25, 189-193, 1979
1491979
Alliances in graphs
P Kristiansen, SM Hedetniemi, ST Hedetniemi
Journal of Combinatorial Mathematics and Combinatorial Computing 48, 157-178, 2004
1442004
Linear algorithms to recognize outerplanar and maximal outerplanar graphs
SL Mitchell
Information Processing Letters 9 (5), 229-232, 1979
1331979
Approximating MAPs for belief networks is NP-hard and other theorems
AM Abdelbar, SM Hedetniemi
Artificial Intelligence 102 (1), 21-38, 1998
1301998
Eternal security in graphs
W Goddard, SM Hedetniemi, ST Hedetniemi
J. Combin. Math. Combin. Comput 52, 169-180, 2005
1202005
Broadcast chromatic numbers of graphs
W Goddard, SM Hedetniemi, ST Hedetniemi, JM Harris, DF Rall
Ars Combinatoria 86, 33-50, 2008
1142008
On the algorithmic complexity of total domination
R Laskar, J Pfaff, SM Hedetniemi, ST Hedetniemi
SIAM Journal on Algebraic Discrete Methods 5 (3), 420-425, 1984
1141984
Linear algorithms for finding the Jordan center and path center of a tree
SM Hedetniemi, EJ Cockayne, ST Hedetniemi
Transportation Science 15 (2), 98-114, 1981
1001981
Offensive alliances in graphs
O Favaron, G Fricke, W Goddard, S Hedetniemi, S Hedetniemi, ...
Discussiones Mathematicae Graph Theory 24 (2), 263-275, 2004
952004
Self-stabilizing algorithms for minimal dominating sets and maximal independent sets
SM Hedetniemi, ST Hedetniemi, DP Jacobs, PK Srimani
Computers & Mathematics with Applications 46 (5-6), 805-811, 2003
862003
A survey of broadcasting and gossiping in communication networks
ST Hedetniemi, SM Hedetniemi, AL Liestman
Networks 18 (4), 319-349, 1988
791988
Broadcasts in graphs
JE Dunbar, DJ Erwin, TW Haynes, SM Hedetniemi, ST Hedetniemi
Discrete Applied Mathematics 154 (1), 59-75, 2006
772006
Alliances in graphs
SM Hedetniemi, ST Hedetniemi, P Kristiansen
J. Combin. Math. Combin. Comput 48, 157-177, 2004
762004
A linear algorithm for the Grundy (coloring) number of a tree
SM Hedetniemi, ST Hedetniemi, T Beyer
Congr. Numer 36, 351-363, 1982
651982
Disjoint dominating sets in graphs
SM Hedetniemi, ST Hedetniemi, RC Laskar, L Markus, PJ Slater
Proc. Int. Conf. on Disc. Math., IMI-IISc, Bangalore 88, 101, 2006
602006
The system can't perform the operation now. Try again later.
Articles 1–20