We introduce DRESS, a deterministic, parameter-free framework that iteratively refines the structural similarity of edges in a graph to produce a canonical fingerprint: a real-valued edge vector, ...

Finding all isomorphism pairs in a graph data set. Running classification models. Given proper format of graphs, one can find all graph orbits in a data set efficiently (i.e. groups of graphs that are ...

Abstract: Given with a graph G and its any isomorphic graph G', a minimum determiner set of G is a minimum set of vertices such that, if these vertices are assigned in one-to-one correspondence ...

ABSTRACT: To effectively evaluate a system that performs operations on UML class diagrams, it is essential to cover a large variety of different types of diagrams. The coverage of the diagram space ...

An audiogram can diagnose your hearing loss and indicate what type of hearing loss you have. It can distinguish your hearing in each ear and whether you have hearing loss on one or both sides. You can ...

The original version of this story appeared in Quanta Magazine. Much of mathematics is driven by intuition, by a deep-rooted sense of what should be true. But sometimes instinct can lead a ...

Abstract: Many properties of interest in graph structures are based on the nodes' average degree (i.e., the average number of edges incident to/from each node). In this work, we present asynchronous ...