Random graphs are generated using Erdős-Rényi- G(n, p) random graph model, where n is the number of nodes of a graph and p is the probability of edge occurrence between two graphs. Here, I used p = ...

Given two graphs which are almost isomorphic, is it possible to find a bijection which preserves most of the edges between the two? This is the algorithmic task of Robust Graph Isomorphism, which is a ...

This Git repository contains the code we wrote in order to generate data and conduct experiments with gcd-graphs over the polynomial rings, as discussed in our paper: [1] Ján Mináč, Tung T. Nguyen, ...

Abstract: Graph matching, or the determination of the vertex correspondences between a pair of graphs, is a crucial task in various problems in different science and engineering disciplines. This ...

Abstract: The identification and enumeration of small, non-isomorphic graphs, called graphlets, within larger graphs is an analytic tool used for graph analytics. The problem of identifying graphlets ...