A new algorithm opens the door for using artificial intelligence and machine learning to study the interactions that happen ...

An optimization is given for minimizing edge crossing problem based on characteristics of adjacency matrix. The representation and transformation methods of hierarchical graph's adjacency matrix are ...

We characterize this encoding in terms of a particular factorization of the adjacency matrix of the original graph. The factorization is determined as the solution of a discrete optimization problem, ...