Introduction to algorithms
Hash codes for the identification and classification of molecular structure elements
Journal of Computational Chemistry
An Efficient Algorithm for Graph Isomorphism
Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Graph Isomorphism: Its Complexity and Algorithms (Abstract)
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Graphs determined by polynomial invariants
Theoretical Computer Science - Random generation of combinatorial objects and bijective combinatorics
Quantitative methods for ecological network analysis
Computational Biology and Chemistry
Combined network complexity measures
IBM Journal of Research and Development
The space complexity of k-tree isomorphism
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
A logspace algorithm for partial 2-tree canonization
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
A history of graph entropy measures
Information Sciences: an International Journal
Structural Analysis of Complex Networks
Structural Analysis of Complex Networks
On some applications of information indices in chemical graph theory
General Theory of Information Transfer and Combinatorics
| Hi-index | 0.07 |
In this paper, we present a computational approach for finding complete graph invariants. Specifically, we generate exhaustive sets of connected, non-isomorphic graphs with 9 and 10 vertices and demonstrate that a 97-dimensional multivariate graph invariant is capable to distinguish each of the non-isomorphic graphs. Furthermore, in order to tame the computational complexity of the problem caused by the vast number of graphs, e.g., involving over 10 million networks with 10 vertices, we suggest a low-dimensional, iterative procedure that is based on highly discriminative individual graph invariants. We show that also this computational approach leads to a perfect discrimination. Overall, our numerical results prove the existence of such graph invariants for networks with 9 and 10 vertices. Furthermore, we show that our iterative approach has a polynomial time complexity.