Pages that link to "Item:Q4128621"
From MaRDI portal
The following pages link to A Fast Backtracking Algorithm to Test Directed Graphs for Isomorphism Using Distance Matrices (Q4128621):
Displaying 14 items.
- A matching algorithm between precursory 3D process model and 2D working procedure drawing based on subgraph isomorphism (Q413023) (← links)
- Isomorphism testing via polynomial-time graph extensions (Q662128) (← links)
- Isomorphism identification of graphs: especially for the graphs of kinematic chains (Q959075) (← links)
- A parametric filtering algorithm for the graph isomorphism problem (Q1020495) (← links)
- A fast backtrack algorithm for graph isomorphism (Q1106855) (← links)
- Pattern associativity and the retrieval of semantic networks (Q1202672) (← links)
- A long trip in the charming world of graphs for pattern recognition (Q1677050) (← links)
- Efficient graph automorphism by vertex partitioning (Q1836990) (← links)
- Parallel algorithms for flexible pattern matching on big graphs (Q2195447) (← links)
- Filtering graphs to check isomorphism and extracting mapping by using the conductance electrical model (Q2418739) (← links)
- SPECTRUM BASED TECHNIQUES FOR GRAPH ISOMORPHISM (Q3636158) (← links)
- Algorithms for finding directed graph isomorphisms by finite automata (Q3865499) (← links)
- Parallel Algorithm for Solving the Graph Isomorphism Problem (Q5060056) (← links)
- Lorentzian spectral geometry with causal sets (Q5162473) (← links)
