A sifting-edges algorithm for accelerating the computation of absolute 1-center in graphs (Q2165256): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s10878-022-00866-x / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10878-022-00866-X / rank | |||
Normal rank | |||
Latest revision as of 07:53, 17 December 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
0 references
