Zur Bestimmung der Automorphismen eines endlichen Graphen

DOI10.1007/BF02252863zbMath0322.05121MaRDI QIDQ1223310

Gottfried Tinhofer

Publication date: 1975

Published in: Computing (Search for Journal in Brave)

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Directed graphs (digraphs), tournaments (05C20) Algorithms in computer science (68W99)

Related Items (1)

Zerlegung der Knotenmengen von Graphen zum Nachweis der Isomorphie

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

This page was built for publication: Zur Bestimmung der Automorphismen eines endlichen Graphen