Pages that link to "Item:Q2764398"
From MaRDI portal
The following pages link to Isomorphism testing algorithm for graphs: Incidence degree sequence method and applications (Q2764398):
Displaying 10 items.
- A new algorithm for isomorphism determination of undirected graphs-circuit simulation method (Q640393) (← links)
- Isomorphism testing via polynomial-time graph extensions (Q662128) (← links)
- Determination of isomorphism and its applications for arbitrary graphs based on circuit simulation (Q733697) (← links)
- The SVE method for regular graph isomorphism identification (Q737027) (← links)
- A fast backtrack algorithm for graph isomorphism (Q1106855) (← links)
- A graph isomorphism algorithm using pseudoinverses (Q1913583) (← links)
- New invariants for the graph isomorphism problem (Q2373963) (← links)
- Study of graph isomorphism by utilizing the concept of special degree of a vertex in a graph (Q2857261) (← links)
- Efficient Method to Perform Isomorphism Testing of Labeled Graphs (Q3603080) (← links)
- (Q3735731) (← links)