An efficient heuristic approach to detecting graph isomorphism based on combinations of highly discriminating invariants

From MaRDI portal

(Redirected from An efficient heuristic approach to detecting graph isomorphism based on combinations of highly discriminating invariants)

Jump to:navigation, search

WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=An_efficient_heuristic_approach_to_detecting_graph_isomorphism_based_on_combinations_of_highly_discriminating_invariants&oldid=77804024"