Pages that link to "Item:Q662128"
From MaRDI portal
The following pages link to Isomorphism testing via polynomial-time graph extensions (Q662128):
Displaying 11 items.
- An efficient heuristic approach to detecting graph isomorphism based on combinations of highly discriminating invariants (Q360469) (← links)
- Extending partial isomorphisms of graphs (Q1204527) (← links)
- A graph isomorphism algorithm for object recognition (Q1273874) (← links)
- Polynomial-time algorithm for isomorphism of graphs with clique-width at most three (Q1986558) (← links)
- Filtering graphs to check isomorphism and extracting mapping by using the conductance electrical model (Q2418739) (← links)
- Isomorphism testing algorithm for graphs: Incidence degree sequence method and applications (Q2764398) (← links)
- Efficient Method to Perform Isomorphism Testing of Labeled Graphs (Q3603080) (← links)
- (Q3735731) (← links)
- (Q3795244) (← links)
- Parallel Algorithm for Solving the Graph Isomorphism Problem (Q5060056) (← links)
- Linear matching-time algorithm for the directed graph isomorphism problem (Q6487989) (← links)