Permutation group algorithms based on directed graphs (Q2042953): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.jalgebra.2021.06.015 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Q4882944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New refiners for permutation group search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutation group algorithms based on directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4335298 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutation group algorithms based on partitions. I: Theory and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical graph isomorphism. II. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2762215 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.JALGEBRA.2021.06.015 / rank
 
Normal rank

Latest revision as of 21:05, 16 December 2024

scientific article
Language Label Description Also known as
English
Permutation group algorithms based on directed graphs
scientific article

    Statements

    Permutation group algorithms based on directed graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    22 July 2021
    0 references
    permutation groups
    0 references
    search algorithms
    0 references
    digraphs
    0 references
    computational group theory
    0 references
    graphs
    0 references
    backtrack search
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers