GIPSY - (Graph Isomorphism Problem Soved Yes!)
A polynomial-time solution to the G.I.P. (the Graph Isomorphism Problem). All non-isomorphic designs can be brought to their Lexicographically Smallest Graph Equivalent (LSGE); finding and proving the Lowest Bounds for any Covering Design without exceptions.
GIPSY's approach to solving the G.I.P. radically differs from contemporary approaches as it completely detaches itself from the rigorous concepts of the G.I.P. that have been persisted all these years without success and focuses solely on the G.I.P. from a numerical standpoint. GIPSY has proven to have expedited the process of finding isomorphic designs by many denominations, something in the order of 10 to the power of 12. Not only does GIPSY outperform any existing partial solution, but GIPSY is extremely more efficient at processing and in memory usage and could be ran on any standard personal-computer.
Currently, GIPSY is only performing searches on t-design requests. Searches can only be performed manually on our end until we deploy the complete version of GIPSY online as a service. When GIPSY is deployed online, searches will be compatible with every type of graph using the same polynomial-time formulae.
GIPSY will eventually be deployed online as a service using Windows Azure to enable to us to fulfill the exhaustive demand from numerous applications.
Graph Theory has found many applications to everyday problems. Some of the more salient applications of Graph Theory are listed on our website: www.combinatoroyal.com