Evolving Bipartite Authentication Graph Partitions
نویسندگان
چکیده
منابع مشابه
Authentication codes and bipartite graphs
In this paper, a characterization of authentication codes in terms of bipartite graphs is given. By using such a characterization, two necessary and sufficient conditions for a minimal authentication code with perfect secrecy are derived. The probabilities of a successful impersonation and of a successful substitution attack are discussed. As a result, some (optimal) minimal authentication code...
متن کاملConvex p-partitions of bipartite graphs
A set of vertices X of a graph G is convex if it contains all vertices on shortest paths between vertices of X. We prove that for fixed p ≥ 1, all partitions of the vertex set of a bipartite graph into p convex sets can be found in polynomial time.
متن کاملGraph Partitions with Minimum
Given a graph with n nodes and minimum degree , we give a polynomial time algorithm that constructs a partition of the nodes of the graph into two sets X and Y such that the sum of the minimum degrees in X and in Y is at least and the cardinalities of X and Y diier by at most (+ 1 if n 6 = (mod2)). The existence of such a partition was shown by 4].
متن کاملGraph colourings and partitions
In this paper we have investigated mainly the three colouring parameters of a graph G, viz., the chromatic number, the achromatic number and the pseudoachromatic number. The importance of their study in connection with the computational complexity, partitions, algebra, projective plane geometry and analysis were brie.y surveyed. Some new results were found along these directions. We have rede0n...
متن کاملSupervised Bipartite Graph Inference
We formulate the problem of bipartite graph inference as a supervised learning problem, and propose a new method to solve it from the viewpoint of distance metric learning. The method involves the learning of two mappings of the heterogeneous objects to a unified Euclidean space representing the network topology of the bipartite graph, where the graph is easy to infer. The algorithm can be form...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Dependable and Secure Computing
سال: 2019
ISSN: 1545-5971,1941-0018,2160-9209
DOI: 10.1109/tdsc.2017.2652469