Pages that link to "Item:Q5242859"
From MaRDI portal
The following pages link to A spectral assignment approach for the graph isomorphism problem (Q5242859):
Displaying 12 items.
- Graph cospectrality using neighborhood matrices (Q456353) (← links)
- Isomorphism testing via polynomial-time graph extensions (Q662128) (← links)
- A graph isomorphism algorithm using pseudoinverses (Q1913583) (← links)
- A completely positive formulation of the graph isomorphism problem and its positive semidefinite relaxation (Q2023115) (← links)
- A time-based solution for the graph isomorphism problem (Q2192286) (← links)
- Continuous relaxations for the traveling salesman problem (Q2296989) (← links)
- Spectral complexity of directed graphs and application to structural decomposition (Q2424711) (← links)
- Some further development on the eigensystem approach for graph isomorphism detection (Q2571822) (← links)
- (Q2975259) (← links)
- On the equivariance properties of self-adjoint matrices (Q3298332) (← links)
- Dynamical Systems Theory and Algorithms for NP-hard Problems (Q5131680) (← links)
- STUDY OF GRAPH ISOMORPHISM USING JORDAN FORMS OF ADJACENCY MATRICES (Q5151220) (← links)