Some Remarks on Kernels
✍ Scribed by Ivana Horová
- Book ID
- 110287533
- Publisher
- Springer
- Year
- 2000
- Tongue
- English
- Weight
- 110 KB
- Volume
- 2
- Category
- Article
- ISSN
- 1572-9206
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
We present in this paper an idea ofhow to reduce the number of possible permutations when trying to solve the permuted kernels problem. We refer to the identification scheme of Shamir [2] and we also show how a dishonest prover can maximize his prospects to pass the test.
## Abstract We prove a conjecture of Favaron et al. that every graph of order __n__ and minimum degree at least three has a total dominating set of size at least __n__/2. We also present several related results about: (1) extentions to graphs of minimum degree two, (2) examining graphs where the bo