Pages that link to "Item:Q2555867"
From MaRDI portal
The following pages link to Isomorfismo fra grafi: un algoritmo efficiente per trovare tutti gli isomorfismi (Q2555867):
Displayed 5 items.
- Graph isomorphism problem (Q1057883) (← links)
- Zur Bestimmung der Automorphismen eines endlichen Graphen (Q1223310) (← links)
- Zerlegung der Knotenmengen von Graphen zum Nachweis der Isomorphie (Q1248626) (← links)
- Graph isomorphism: A heuristic edge-partitioning-oriented algorithm (Q1843304) (← links)
- A note on the derivation of maximal common subgraphs of two directed or undirected graphs (Q2560433) (← links)