Similarity testing for circuits is an important task in the identification of possible infringement of intellectual property rights. In this paper, we propose a novel procedure for global similarity measurement between circuit topologies (networks) and apply this procedure to the comparison of physical designs of circuits. We first construct networks to describe the way in which circuit elements interact. Then, we evaluate the properties of each node from the resulting networks by calculating the cumulative distribution of characteristic parameters such as degree, clustering coefficient, etc. Based on the maximum vertical distance of each pair of distributions, global similarity testing methods are proposed with consideration of the inhomog...
In this paper we propose two methods to derive different kinds of node neighborhood based similariti...
Subject of this dissertation is the assessment of graph similarity. The application context and ulti...
Being able to effectively measure similarity between patents in a complex patent citation network is...
Quantifying similarity between nodes is a fundamental and challenging task in many fields of complex...
Plagiarism of integrated-circuit (IC) layout is a problem encountered both in academia and in indust...
Abstract Knowledge that quantifies the similarity between complex objects forms a vital part of prob...
We consider the problem of determining how similar two networks (without known node-correspondences)...
We consider methods for quantifying the similarity of vertices in networks. We propose a measure of ...
In this paper we solve the problem of identify-ing a \matching " between two logic circuits or ...
We evaluate the discrimination power of different graph invariants in order to identify an appropria...
We evaluate the discrimination power of different graph invariants in order to identify an appropria...
A molecular similarity measure has been developed using molecular topological graphs and atomic part...
The article of record as published may be found at http://dx.doi.org/10.1007/s41109-017-0042-3Most r...
2018 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)De...
A hard problem in network testing is verifying the correctness of a class of networks, as well as th...
In this paper we propose two methods to derive different kinds of node neighborhood based similariti...
Subject of this dissertation is the assessment of graph similarity. The application context and ulti...
Being able to effectively measure similarity between patents in a complex patent citation network is...
Quantifying similarity between nodes is a fundamental and challenging task in many fields of complex...
Plagiarism of integrated-circuit (IC) layout is a problem encountered both in academia and in indust...
Abstract Knowledge that quantifies the similarity between complex objects forms a vital part of prob...
We consider the problem of determining how similar two networks (without known node-correspondences)...
We consider methods for quantifying the similarity of vertices in networks. We propose a measure of ...
In this paper we solve the problem of identify-ing a \matching " between two logic circuits or ...
We evaluate the discrimination power of different graph invariants in order to identify an appropria...
We evaluate the discrimination power of different graph invariants in order to identify an appropria...
A molecular similarity measure has been developed using molecular topological graphs and atomic part...
The article of record as published may be found at http://dx.doi.org/10.1007/s41109-017-0042-3Most r...
2018 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)De...
A hard problem in network testing is verifying the correctness of a class of networks, as well as th...
In this paper we propose two methods to derive different kinds of node neighborhood based similariti...
Subject of this dissertation is the assessment of graph similarity. The application context and ulti...
Being able to effectively measure similarity between patents in a complex patent citation network is...