A sifting-edges algorithm for accelerating the computation of absolute 1-center in graphs (Q2165256): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 00:43, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A sifting-edges algorithm for accelerating the computation of absolute 1-center in graphs |
scientific article |
Statements
A sifting-edges algorithm for accelerating the computation of absolute 1-center in graphs (English)
0 references
19 August 2022
0 references
absolute 1-center
0 references
saddle point
0 references
sifting edges
0 references
