On solving a non-convex quadratic programming problem involving resistance distances in graphs (Q2177791)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On solving a non-convex quadratic programming problem involving resistance distances in graphs |
scientific article; zbMATH DE number 7197653
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On solving a non-convex quadratic programming problem involving resistance distances in graphs |
scientific article; zbMATH DE number 7197653 |
Statements
On solving a non-convex quadratic programming problem involving resistance distances in graphs (English)
0 references
6 May 2020
0 references
resistance distance
0 references
Laplacian matrix
0 references
non-convex quadratic programming
0 references
polynomial time algorithm
0 references
symmetric bimatrix game
0 references
0 references
0 references
0 references
0.8510501384735107
0 references
0.7081698179244995
0 references
0.6962248682975769
0 references
0.6951023936271667
0 references
