Self-stabilizing algorithms for minimal dominating sets and maximal independent sets von Hedetniemi, S.M., Hedetniemi, S.T., Jacobs, D.P., Srimani, P.K.

Volltext

Topics on Domination von Hedetniemi, S. T, Laskar, R. C

Volltext

On the computational complexity of upper fractional domination von Cheston, Grant A., Fricke, G., Hedetniemi, S.T., Pokrass Jacobs, D.

Volltext

On k-dependent domination von FAVARON, O, HEDETNIEMI, S. M, HEDETNIEMI, S. T, RALL, D. F

Volltext

Acyclic domination von Hedetniemi, S.M., Hedetniemi, S.T., Rall, D.F.

Volltext

On [formula omitted]-dependent domination von Favaron, O., Hedetniemi, S.M., Hedetniemi, S.T., Rall, D.F.

Volltext

Bibliography on domination in graphs and some basic definitions of domination parameters von Hedetniemi, S.T., Laskar, R.C.

Volltext

Irredundant and perfect neighbourhood sets in trees von Cockayne, E.J., Hedetniemi, S.M., Hedetniemi, S.T., Mynhardt, C.M.

Volltext

Using maximality and minimality conditions to construct inequality chains von Cockayne, E.J., Hattingh, J.H., Hedetniemi, S.M., Hedetniemi, S.T., McRae, A.A.

Volltext

Introduction von Hedetniemi, S.T., Laskar, R.C.

Volltext

The even adjacency split problem for graphs von Cheston, Grant A., Hedetniemi, S.T., Liestman, Arthur L., Stehman, J.B.

Volltext

Maximal irredundant functions von Fricke, G.H., Hedetniemi, S.T., Jacobs, D.P.

Volltext

A linear algorithm for finding a minimum dominating set in a cactus von Hedetniemi, S.T, Laskar, Renu, Pfaff, John

Volltext

Self-stabilizing protocols for maximal matching and maximal independent sets for ad hoc networks von Goddard, W., Hedetniemi, S.T., Jacobs, D.P., Srimani, P.K.

Volltext

Efficient sets in graphs von Bernhard, P.J., Hedetniemi, S.T., Jacobs, D.P.

Volltext

The subchromatic number of a graph von Albertson, M.O., Jamison, R.E., Hedetniemi, S.T., Locke, S.C.

Volltext

A self-stabilizing distributed algorithm for minimal total domination in an arbitrary system graph von Goddard, W., Hedetniemi, S.T., Jacobs, D.P., Srimani, P.K.

Volltext

Fault tolerant algorithms for orderings and colorings von Goddard, W., Hedetniemi, S.T., Jacobs, D.P., Srimani, P.K.

Volltext bestellen

Gallai theorems for graphs, hypergraphs, and set systems von Cockayne, E.J., Hedetniemi, S.T., Laskar, R.

Volltext

Bibliography on Domination in Graphs and Some Basic Definitions of Domination Parameters von Hedetniemi, S.T., Laskar, R.C.

Volltext