A sifting-edges algorithm for accelerating the computation of absolute 1-center in graphs (Q2165256): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10878-022-00866-x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4280619077 / rank | |||
Normal rank | |||
Revision as of 23:13, 19 March 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
