A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs (Q5297139): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 21:41, 8 February 2024

scientific article; zbMATH DE number 5172155
Language Label Description Also known as
English
A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs
scientific article; zbMATH DE number 5172155

    Statements

    A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs (English)
    0 references
    0 references
    0 references
    18 July 2007
    0 references
    graph algorithms
    0 references
    randomized algorithms
    0 references
    shortest path
    0 references
    spanner
    0 references

    Identifiers