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

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1007/s10878-022-00866-x / rank
Normal rank
 
Property / cites work
 
Property / cites work: Algorithms for the minimum diameter terminal Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An FPTAS for generalized absolute 1-center problem in vertex-weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of location analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fibonacci heaps and their uses in improved network optimization algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minimum diameter spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the Hidden Path: Time Bounds for All-Pairs Shortest Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithmic Approach to Network Location Problems. I: The<i>p</i>-Centers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to all-pairs shortest paths on real-weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network location of a reliable center using the most reliable route policy / rank
 
Normal rank
Property / cites work
 
Property / cites work: State of the Art—Location on Networks: A Survey. Part I: The <i>p</i>-Center and <i>p</i>-Median Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4355484 / rank
 
Normal 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
    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