Zerlegung der Knotenmengen von Graphen zum Nachweis der Isomorphie (Q1248626): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
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: Graph isomorphism: A heuristic edge-partitioning-oriented algorithm / 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: Zur Bestimmung der Automorphismen eines endlichen Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4141837 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4105691 / rank
 
Normal rank

Revision as of 22:52, 12 June 2024

scientific article
Language Label Description Also known as
English
Zerlegung der Knotenmengen von Graphen zum Nachweis der Isomorphie
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references