Sandra M. Hedetniemi

Author

Also Known As

S. M. Hedetniemi, S. Mitchell Hedetniemi, S.M. Hedetniemi, SANDRA M. HEDETNIEMI, Sandra Hedetniemi, Sandra M Hedetniemi, Sandra M. Hedetniemi, Sandra Mitchell Hedetniemi

Publications

3.3K

Citations

H-Index

Concepts

All Affiliations

Clemson University University of Victoria Furman University East Tennessee State University Morehead State University

About

Sandra M. Hedetniemi is an author at Clemson University specializing in graph theory, discrete mathematics, and combinatorial optimization.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	10	10	2.2K
2	Education	5	5	1.1K
3	Business	3	3	147
4	Classics	2	2	553
5	Arts	1	1	1.2K

Sandra M. Hedetniemi

Publications

3.2K

Citations

H-Index

Page 1

	Year	Citations
A survey of gossiping and broadcasting in communication networks Sandra M. Hedetniemi, Stephen T. Hedetniemi, Arthur L. Liestman Networks EngineeringNetwork AnalysisCommunicationRumor SpreadingUnique Item	1988	1.2K
Roman domination in graphs E. J. Cockayne, Paul Dreyer, Sandra M. Hedetniemi, Discrete Mathematics Graph TheoryRoman DominationStructural Graph TheoryTopological Graph TheoryExtremal Graph Theory	2003	541
Domination in Graphs Applied to Electric Power Networks Teresa W. Haynes, Sandra M. Hedetniemi, Stephen T. Hedetniemi, SIAM Journal on Discrete Mathematics EngineeringPlanar GraphNetwork AnalysisEducationComputational Complexity	2002	350
Approximating MAPs for belief networks is NP-hard and other theorems Ashraf M. Abdelbar, Sandra M. Hedetniemi Artificial Intelligence Mathematical ProgrammingComputational Complexity TheoryEngineeringGraph TheoryProbabilistic Graph Theory	1998	140
On the Algorithmic Complexity of Total Domination Renu Laskar, John Pfaff, Sandra M. Hedetniemi, SIAM Journal on Algebraic and Discrete Methods Mathematical ProgrammingDirected GraphComputational Complexity TheoryEngineeringNetwork Analysis	1984	119
Constant Time Generation of Rooted Trees Terry Beyer, Sandra M. Hedetniemi SIAM Journal on Computing Tree LanguageN VerticesCombinatorics On WordEngineeringGraph Theory	1980	109
Linear Algorithms for Finding the Jordan Center and Path Center of a Tree Sandra M. Hedetniemi, E. J. Cockayne, Stephen T. Hedetniemi Transportation Science Jordan CenterPath CenterLinear AlgorithmsGraph TheoryWeighted Jordan Center	1981	88
Self-stabilizing algorithms for minimal dominating sets and maximal independent sets Sandra M. Hedetniemi, Stephen T. Hedetniemi, David P. Jacobs, Computers & Mathematics with Applications Mathematical ProgrammingEngineeringSelf-stabilizing AlgorithmsPerformance GuaranteeCombinatorial Design	2003	84
Broadcasts in graphs Jean E. Dunbar, David Erwin, Teresa W. Haynes, Discrete Applied Mathematics Network ScienceGraph TheoryRandom GraphNetwork AnalysisGraph Signal Processing	2005	75
Offensive alliances in graphs Odile Favaron, Gerd H. Fricke, Wayne Goddard, Discussiones Mathematicae Graph Theory Network EvolutionNetwork ScienceGraph TheoryBusinessNetwork Analysis	2004	70

Page 1