Sandra Mitchell Hedetniemi

According to our database, Sandra Mitchell Hedetniemi authored at least 34 papers between 1978 and 2016.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2016

A Roman Domination Chain.

Mustapha Chellali, Teresa W. Haynes, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae

Graphs Comb., 2016

2013

Self-stabilizing Algorithms for Unfriendly Partitions into Two Disjoint Dominating Sets.

Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, K. E. Kennedy, Alice A. McRae

Parallel Process. Lett., 2013

2012

A self-stabilizing algorithm for optimally efficient sets in graphs.

Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Hao Jiang, Ken Kennedy, Alice A. McRae

Inf. Process. Lett., 2012

2011

γ-graphs of graphs.

Gerd Fricke, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Kevin R. Hutson

Discuss. Math. Graph Theory, 2011

Matchability and k-maximal matchings.

Brian C. Dean, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Jason Lewis, Alice A. McRae

Discret. Appl. Math., 2011

2008

Braodcast Chromatic Numbers of Graphs.

Wayne Goddard, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, John M. Harris, Douglas F. Rall

Ars Comb., 2008

2006

Broadcasts in graphs.

Jean E. Dunbar, David J. Erwin, Teresa W. Haynes, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi

Discret. Appl. Math., 2006

2005

Generalized subgraph-restricted matchings in graphs.

Wayne Goddard, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Renu C. Laskar

Discret. Math., 2005

2004

Offensive alliances in graphs.

Odile Favaron, Gerd Fricke, Wayne Goddard, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Petter Kristiansen, Renu C. Laskar, R. Duane Skaggs

Discuss. Math. Graph Theory, 2004

Iterated colorings of graphs.

Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae, Dee Parks, Jan Arne Telle

Discret. Math., 2004

Roman domination in graphs.

Ernest J. Cockayne, Paul A. Dreyer Jr., Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi

Discret. Math., 2004

Domination and irredundance in tournaments.

K. Brooks Reid, Alice A. McRae, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi

Australas. J Comb., 2004

2002

Domination in Graphs Applied to Electric Power Networks.

Teresa W. Haynes, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Michael A. Henning

SIAM J. Discret. Math., 2002

On <i>k</i>-dependent domination.

Odile Favaron, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Douglas F. Rall

Discret. Math., 2002

2001

Domination Subdivision Numbers.

Teresa W. Haynes, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, David Pokrass Jacobs, James A. Knisely, Lucas C. van der Merwe

Discuss. Math. Graph Theory, 2001

2000

Domination and independence subdivision numbers of graphs.

Teresa W. Haynes, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi

Discuss. Math. Graph Theory, 2000

Acyclic domination.

Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Douglas F. Rall

Discret. Math., 2000

The complexity of approximating MAPs for belief networks with bounded probabilities.

Ashraf M. Abdelbar, Stephen T. Hedetniemi, Sandra Mitchell Hedetniemi

Artif. Intell., 2000

1999

On perfect neighborhood sets in graphs.

Gerd Fricke, Teresa W. Haynes, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Michael A. Henning

Discret. Math., 1999

1998

Irredundant and perfect neighbourhood sets in trees.

Ernest J. Cockayne, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Christina M. Mynhardt

Discret. Math., 1998

Approximating MAPs for Belief Networks is NP-Hard and Other Theorems.

Ashraf M. Abdelbar, Sandra Mitchell Hedetniemi

Artif. Intell., 1998

1997

Using maximality and minimality conditions to construct inequality chains.

Ernest J. Cockayne, Johannes H. Hattingh, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae

Discret. Math., 1997

k-Path Partitions in Trees.

Jing-Ho Yan, Gerard J. Chang, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi

Discret. Appl. Math., 1997

A parallel hybrid genetic algorithm simulated annealing approach to finding most probable explanations on Bayesian belief networks.

Ashraf M. Abdelbar, Sandra Mitchell Hedetniemi

Proceedings of International Conference on Neural Networks (ICNN'97), 1997

1995

Nearly perfect sets in graphs.

Jean E. Dunbar, Frederick C. Harris Jr., Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae, Renu C. Laskar

Discret. Math., 1995

1988

A survey of gossiping and broadcasting in communication networks.

Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Arthur L. Liestman

Networks, 1988

1985

Interior graphs of maximal outerplane graphs.

Sandra Mitchell Hedetniemi, Andrzej Proskurowski, Maciej M. Syslo

J. Comb. Theory, Ser. B, 1985

1980

Rectilinear Steiner Trees in Rectangle Trees.

Arthur M. Farley, Stephen T. Hedetniemi, Sandra L. Mitchell

SIAM J. Algebraic Discret. Methods, 1980

Constant Time Generation of Rooted Trees.

Terry Beyer, Sandra Mitchell Hedetniemi

SIAM J. Comput., 1980

1979

Linear Algorithms on Recursive Representations of Trees.

Sandra L. Mitchell, Ernest J. Cockayne, Stephen T. Hedetniemi

J. Comput. Syst. Sci., 1979

Linear Algorithms for Isomorphism of Maximal Outerplanar Graphs.

Terry Beyer, W. Jones, Sandra L. Mitchell

J. ACM, 1979

Linear Algorithms for Edge-Coloring Trees and Unicyclic Graphs.

Sandra L. Mitchell, Stephen T. Hedetniemi

Inf. Process. Lett., 1979

Linear Algorithms to Recognize Outerplanar and Maximal Outerplanar Graphs.

Sandra L. Mitchell

Inf. Process. Lett., 1979

1978

Another characterization of the centroid of a tree.

Sandra L. Mitchell

Discret. Math., 1978