Cargando...
On convex relaxation of graph isomorphism
We consider the problem of exact and inexact matching of weighted undirected graphs, in which a bijective correspondence is sought to minimize a quadratic weight disagreement. This computationally challenging problem is often relaxed as a convex quadratic program, in which the space of permutations...
Gardado en:
| Publicado en: | Proc Natl Acad Sci U S A |
|---|---|
| Main Authors: | , , |
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado: |
National Academy of Sciences
2015
|
| Assuntos: | |
| Acceso en liña: | https://ncbi.nlm.nih.gov/pmc/articles/PMC4364177/ https://ncbi.nlm.nih.gov/pubmed/25713342 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1073/pnas.1401651112 |
| Tags: |
Engadir etiqueta
Sen Etiquetas, Sexa o primeiro en etiquetar este rexistro!
|