E-LIB Suche - Ergebnisse für: Hedetniemi, S. T.

1

Computers in Language Research

Trends in Linguistics. Studies and Monographs [TiLSM] ; 5

Backer, Paul O ; Benson, David B ; Bohnert, Herbert G... - Reprint 2021 . , [2021]

Link: https://doi.org/10.1515/..

2

Linear-Time Self-Stabilizing Algorithms for Disjoint Indepe..:

Hedetniemi, S. T. ; Jacobs, D. P. ; Kennedy, K. E.
The Computer Journal. 56 (2012) 11 - p. 1381-1387 , 2012

Link: https://doi.org/10.1093/..

3

Self-stabilizing algorithms for minimal dominating sets and..:

Hedetniemi, S.M. ; Hedetniemi, S.T. ; Jacobs, D.P..
Computers & Mathematics with Applications. 46 (2003) 5-6 - p. 805-811 , 2003

Link: https://doi.org/10.1016/..

4

On k-dependent domination:

Favaron, O. ; Hedetniemi, S.M. ; Hedetniemi, S.T..
Discrete Mathematics. 249 (2002) 1-3 - p. 83-94 , 2002

Link: https://doi.org/10.1016/..

5

The even adjacency split problem for graphs:

Cheston, Grant A. ; Hedetniemi, S.T. ; Liestman, Arthur L..
Discrete Applied Mathematics. 102 (2000) 3 - p. 175-188 , 2000

Link: https://doi.org/10.1016/..

6

Acyclic domination:

Hedetniemi, S.M. ; Hedetniemi, S.T. ; Rall, D.F.
Discrete Mathematics. 222 (2000) 1-3 - p. 151-165 , 2000

Link: https://doi.org/10.1016/..

7

Irredundant and perfect neighbourhood sets in trees:

Cockayne, E.J. ; Hedetniemi, S.M. ; Hedetniemi, S.T..
Discrete Mathematics. 188 (1998) 1-3 - p. 253-260 , 1998

Link: https://doi.org/10.1016/..

8

Using maximality and minimality conditions to construct ine..:

Cockayne, E.J. ; Hattingh, J.H. ; Hedetniemi, S.M...
Discrete Mathematics. 176 (1997) 1-3 - p. 43-61 , 1997

Link: https://doi.org/10.1016/..

9

Maximal irredundant functions:

Fricke, G.H. ; Hedetniemi, S.T. ; Jacobs, D.P.
Discrete Applied Mathematics. 68 (1996) 3 - p. 267-277 , 1996

Link: https://doi.org/10.1016/..

10

Efficient sets in graphs:

Bernhard, P.J. ; Hedetniemi, S.T. ; Jacobs, D.P.
Discrete Applied Mathematics. 44 (1993) 1-3 - p. 99-108 , 1993

Link: https://doi.org/10.1016/..

11

Topics on domination

Annals of discrete mathematics ; 48

Hedetniemi, S. T. ; Laskar, R. C. , 1991

Link: https://www.sciencedirec..

12

Bibliography on Domination in Graphs and Some Basic Definit..:

, In: Topics on Domination; Annals of Discrete Mathematics,

Hedetniemi, S.T. ; Laskar, R.C. - p. 257-277 , 1991

Link: https://doi.org/10.1016/..

13

On the computational complexity of upper fractional dominat..:

Cheston, Grant A. ; Fricke, G. ; Hedetniemi, S.T..
Discrete Applied Mathematics. 27 (1990) 3 - p. 195-207 , 1990

Link: https://doi.org/10.1016/..

14

Introduction:

Hedetniemi, S.T. ; Laskar, R.C.
Discrete Mathematics. 86 (1990) 1-3 - p. 3-9 , 1990

Link: https://doi.org/10.1016/..

15

Bibliography on domination in graphs and some basic definit..:

Hedetniemi, S.T. ; Laskar, R.C.
Discrete Mathematics. 86 (1990) 1-3 - p. 257-277 , 1990

Link: https://doi.org/10.1016/..