MOD-2 independence and domination in graphs

International Journal of Foundations of Computer Science

Volumn 11, Issue 3, 2000, Pages 355-363

  Halldórsson, Magnús M ^a   Kratochvíl, Jan ^b   Telle, Jan Arne ^c  

^a UNIVERSITY OF ICELAND   (Iceland)

^b CHARLES UNIVERSITY   (Czech Republic)

^c UNIVERSITY OF BERGEN   (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 67349164420     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054100000272     Document Type: Article

References (11)

1. E. Berlekamp, R.J. McEliece and H.C.A. van Tilborg, On the inherent intractability of certain coding problems, IEEE Trans. Inform. Theory. Vol.29, No.3, 1978, 384r386.
2. Y. Cairo and W. Klostermeyer, The odd domination number of a graph, submitted.
3. M. HaUdorsson, unpublished.
4. M. HaUdorsson, J. Kratochvil and J.A. Telle, Independent sets with domination constraints, Proceedings ICALP'98 -25th International Colloquium, on Automata, Languages and Programming, Aalborg, Denmark, July 1998, LNCS vol. 1443, 176-187
5. M. Mahajan and V. Vinay, Determinant: combinatorics, algorithms, complexity, Chicago Journal of Theoretical Computer Science, 1997:5, 1997. PreHminary version SODA'97.
6. M. Mahajan and V. Vinay, Determinant: Old Algorithms, New Insights, in Proceedings SWAT'98 -6th Scandinavian Workshop on Algorithm Theory, Stockholm, Sweden, July 1998, LNCS Vol. 1432, 276-287.
7. S.C. Ntafos and S.L. Hakimi, On the complexity of some coding problems, IEEE Trans. Inform. Theory, Vol. 27, 1981, 794r796.
8. K. Sutner, Linear cellular automata and the Garden-of-Eden, The MAthematical Intelligencer, vol.11, no.2, 49-53
9. J.A. Telle, Characterization of domination-type parameters in graphs, Proceedings of 24th Southeastern International Conference on Combinatorics, Graph Theory and Computing -Congressus Numerantium Vol.94 1993, 9-16.
10. J.A. Telle, Complexity of domination-type problems in graphs, Nordic Journal of Computing 1(1994), 157-171.
11. A. Vardy, The intractability of computing the minimum distance of a code, IEEE Trans. Inform. Theory. Vol.43 No. 6, 1997, 1757-1766. Preliminary version STOC'97.