Hosted on MSN2mon
Hard in theory, easy in practice: Why graph isomorphism algorithms seem to be so effectiveIn discrete mathematics, they are structures ... This approach facilitates the comparison across a large pool of graphs. "Algorithms based on color refinement seem to work in most cases in practice.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback