13 An induced matching of a graph G is a matching having no two edges joined by14 an edge. An efficient edge dominating set of G is an induced matching M such that15 every other ed...
Domingos Moreira Cardoso, J. Orestes Cerdeira, Cha...
: It is well known that, in a topological space, the open sets can be characterized using filter convergence. In ZF (Zermelo-Fraenkel set theory without the Axiom of Choice), we c...
Any Gray code for a set of combinatorial objects defines a total order relation on this set: x is less than y if and only if y occurs after x in the Gray code list. Let ≺ denot...
Active learning [1] is a branch of Machine Learning in which the learning algorithm, instead of being directly provided with pairs of problem instances and their solutions (their l...
Abstract. Signcryption as a single cryptographic primitive offers both confidentiality and authentication simultaneously. Generally in signcryption schemes, the message is hidden a...
S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Ra...