A greedy algorithm enhancing cage search
Douglas Wayne Ray · 2004
A cubic cage is a regular graph of degree three with given girth and a minimum number of vertices. Current information about cubic cages is surveyed. A greedy algorithm that permits extremely sparse descriptions of known cages is presented. A number of methods for enhancing the algorithm performance is given. Also, a strategy for looking for better bounds on as yet unknown cages is presented.