Zur Bestimmung der Automorphismen eines endlichen Graphen
From MaRDI portal
Publication:1223310
DOI10.1007/BF02252863zbMath0322.05121MaRDI QIDQ1223310
Publication date: 1975
Published in: Computing (Search for Journal in Brave)
05C25: Graphs and abstract algebra (groups, rings, fields, etc.)
05C20: Directed graphs (digraphs), tournaments
68W99: Algorithms in computer science
Related Items
Cites Work
- Unnamed Item
- Graph isomorphism: A heuristic edge-partitioning-oriented algorithm
- Ein Verfahren zur Feststellung der Isomorphie von endlichen, zusammenhängenden Graphen. (A method to establish the isomorphy of finite connected graphs.)
- Isomorfismo fra grafi: un algoritmo efficiente per trovare tutti gli isomorfismi
- An Efficient Algorithm for Graph Isomorphism
- GIT—a heuristic program for testing pairs of directed line graphs for isomorphism