[Nauty] Efficient Filtering of Graphs Based on Matching-Number Constraints

[mskala at ansuz.sooke.bc.ca]

On Sun, 23 Nov 2025, lczhangmath via Nauty wrote:

> again using writeg6 in the required format. This means that I am
> spending time both decoding and re-encoding graph6, which feels somewhat
> wasteful. What I would like to ask is whether there is a more efficient

Have you profiled this code?  I think it's likely that if you actually
measure the time spent encoding and decoding the graphs, you'll find it is
only a very small percentage of the overall CPU consumption of your
program, and not worth worrying about.  And, on the other hand, if it does
turn out that decoding and re-encoding is taking a significant fraction of
the program's running time after all, then the profiling data will be
valuable in figuring out how to optimize it.

-- 
Matthew Skala
mskala at ansuz.sooke.bc.ca                 People before tribes.
https://ansuz.sooke.bc.ca/