Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
131 tokens/sec
GPT-4o
10 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

On an Algorithm for Isomorphism-Free Generations of Combinatorial Objects (1404.6451v1)

Published 25 Apr 2014 in cs.DS, cs.DM, and math.CO

Abstract: In the work are defined the concepts semi-canonical and canonical binary matrix. What is described is an algorithm solving the combinatorial problem for finding the semi-canonical matrices in the set \Lambda_nk consisting of all n\times n binary matrices having exactly k 1's in every row and every column without perambulating all elements. In the described algorithm bitwise operations are substantially used. In this way it becomes easier to find the solution to the problem for receiving one representative from every equivalence class regarding the introduced in the article equivalence relation in the set \Lambda_nk. The last problem is equivalent to the problem for finding all canonical matrices in \Lambda_nk.

Citations (1)

Summary

We haven't generated a summary for this paper yet.