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

@@ Property / author @@
+Gottfried Tinhofer
@@ Property / author: Gottfried Tinhofer / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+An Efficient Algorithm for Graph Isomorphism
@@ Property / cites work: An Efficient Algorithm for Graph Isomorphism / rank @@
+Normal rank
@@ Property / cites work @@
+Ein Verfahren zur Feststellung der Isomorphie von endlichen, zusammenhängenden Graphen. (A method to establish the isomorphy of finite connected graphs.)
+Normal rank
@@ Property / cites work @@
+Graph isomorphism: A heuristic edge-partitioning-oriented algorithm
+Normal rank
@@ Property / cites work @@
+Isomorfismo fra grafi: un algoritmo efficiente per trovare tutti gli isomorfismi
+Normal rank
@@ Property / cites work @@
+Zur Bestimmung der Automorphismen eines endlichen Graphen
+Normal rank
@@ Property / cites work @@
+Q4141837
@@ Property / cites work: Q4141837 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4105691
@@ Property / cites work: Q4105691 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf02244021
+Normal rank
@@ Property / OpenAlex ID @@
+W57754874
@@ Property / OpenAlex ID: W57754874 / rank @@
+Normal rank