Recently, Tian et al. presented an article, in which they discussed some security weaknesses of Yoon et al.'s scheme and subsequently proposed two "improved" scheme...
The idea of graph compositions, which was introduced by A. Knopfmacher and M. E. Mays, generalizes both ordinary compositions of positive integers and partitions of finite sets. ...
A graph is self-complementary if it is isomorphic to its complement. In this paper we prove that every forest of order 4p and size less than 3p is a subgraph of a self-complementa...
Application of hybrid recommendation enables overcoming disadvantages of the basic recommendation methods: demographic, collaborative and content-based. In this paper the two cons...
Given an undirected hypergraph and a subset of vertices S V with a specified root vertex r S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the hypered...