Zur Bestimmung der Automorphismen eines endlichen Graphen (Q1223310): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: GIT—a heuristic program for testing pairs of directed line graphs for isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Algorithm for Graph Isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ein Verfahren zur Feststellung der Isomorphie von endlichen, zusammenhängenden Graphen. (A method to establish the isomorphy of finite connected graphs.) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isomorfismo fra grafi: un algoritmo efficiente per trovare tutti gli isomorfismi / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph isomorphism: A heuristic edge-partitioning-oriented algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5661805 / rank
 
Normal rank

Latest revision as of 17:11, 12 June 2024

scientific article
Language Label Description Also known as
English
Zur Bestimmung der Automorphismen eines endlichen Graphen
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references