Concepedia

Sandra M. Hedetniemi

SM

26

Publications

3.2K

Citations

19

H-Index

1980

Active since

Affiliations

Clemson University(Current)

University of Victoria

Furman University

East Tennessee State University

Morehead State University

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

Top concepts

Discrete MathematicsGraph TheoryCombinatorial OptimizationEngineeringComputer ScienceNetwork AnalysisComputational ComplexityEducationNetwork ScienceMathematical Programming

Publications per year

1980–2015

26

Publications

26

A survey of gossiping and broadcasting in communication networks

Sandra M. Hedetniemi, Stephen T. Hedetniemi, Arthur L. Liestman · Networks · 1988 · 1.2K citations

Engineering, Network Analysis, Communication +17

Roman domination in graphs

E. J. Cockayne, Paul Dreyer, Sandra M. Hedetniemi et al. · Discrete Mathematics · 2003 · 541 citations

Graph Theory, Roman Domination, Structural Graph Theory +7

Domination in Graphs Applied to Electric Power Networks

Teresa W. Haynes, Sandra M. Hedetniemi, Stephen T. Hedetniemi et al. · SIAM Journal on Discrete Mathematics · 2002 · 350 citations

Engineering, Planar Graph, Network Analysis +18

Approximating MAPs for belief networks is NP-hard and other theorems

Ashraf M. Abdelbar, Sandra M. Hedetniemi · Artificial Intelligence · 1998 · 140 citations

Mathematical Programming, Computational Complexity Theory, Engineering +11

On the Algorithmic Complexity of Total Domination

Renu Laskar, John Pfaff, Sandra M. Hedetniemi et al. · SIAM Journal on Algebraic and Discrete Methods · 1984 · 119 citations

Mathematical Programming, Directed Graph, Computational Complexity Theory +19

Rows per page

1–5 of 26