Description: The algorithm divides rows into three equal groups. The rows are then connnected to form a distance graph which is then transformed in to a matrix. Girth of six is maintained by avoiding four-cycles. No two rows are connected more than once (the row-column constraint).
To Search:
File list (Check if you may need any files):
girth63rr.m
license.txt
Download