A sifting-edges algorithm for accelerating the computation of absolute 1-center in graphs (Q2165256)

From MaRDI portal
Revision as of 04:41, 1 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    0 references
    0 references
    19 August 2022
    0 references
    absolute 1-center
    0 references
    saddle point
    0 references
    sifting edges
    0 references

    Identifiers