Wiki › Technique

Graph isomorphism

Technique

No article has been written for this page yet; it is generated from the knowledge graph.
About Graph isomorphism · from Wikipedia

In graph theory, an isomorphism of graphs G and H is a bijection between the vertex sets of G and H

Summary from Wikipedia ↗, CC BY-SA 4.0.
  • Graph classification experiments Feb 2025
    A classical baseline that uses NetworkX's GraphMatcher to check exact isomorphism and compute a structural similarity score.

As data

Everything on this page is read from triples in the knowledge graph. These are the 4 it states about Graph isomorphism, and 1 more its ontology implies; the console runs SPARQL over the whole graph, here in your browser.

Download
@prefix id: <https://ask.chaipat.cc/id/> .
@prefix rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#> .
@prefix cj: <https://ask.chaipat.cc/ns#> .
@prefix rdfs: <http://www.w3.org/2000/01/rdf-schema#> .
@prefix skos: <http://www.w3.org/2004/02/skos/core#> .
@prefix schema: <https://schema.org/> .

id:GraphIsomorphism
    a cj:Technique ;
    rdfs:label "Graph isomorphism" ;
    skos:altLabel "isomorphism" ;
    schema:sameAs <https://en.wikipedia.org/wiki/Graph_isomorphism> .
Works 1
Graph classification experiments