1 - 1 / 1 1 |
1. A symmetry-breaking node equivalence for pruning the search space in backtracking algorithms Uroš Čibej, Luka Fürst, Jurij Mihelič, 2019, izvirni znanstveni članek Ključne besede: graph equivalence, symmetry breaking, backtracking, monomorphism search, search tree pruning, graph algorithm |