Zerlegung der Knotenmengen von Graphen zum Nachweis der Isomorphie
From MaRDI portal
Publication:1248626
DOI10.1007/BF02244021zbMath0383.05001OpenAlexW57754874MaRDI QIDQ1248626
J. Hinteregger, Gottfried Tinhofer
Publication date: 1977
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02244021
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph theory (05C99) Software, source code, etc. for problems pertaining to combinatorics (05-04)
Cites Work
- Unnamed Item
- Unnamed Item
- Zur Bestimmung der Automorphismen eines endlichen Graphen
- 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