Approximate distance oracles for unweighted graphs in expected <i>O</i> ( <i>n</i> <sup>2</sup> ) time (Q2944530): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Sandeep Sen / rank
Normal rank
 
Property / author
 
Property / author: Sandeep Sen / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1145/1198513.1198518 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2157760787 / rank
 
Normal rank

Latest revision as of 19:55, 19 March 2024

scientific article
Language Label Description Also known as
English
Approximate distance oracles for unweighted graphs in expected <i>O</i> ( <i>n</i> <sup>2</sup> ) time
scientific article

    Statements

    Approximate distance oracles for unweighted graphs in expected <i>O</i> ( <i>n</i> <sup>2</sup> ) time (English)
    0 references
    0 references
    0 references
    2 September 2015
    0 references
    approximate distance oracles
    0 references
    distance queries
    0 references
    distances
    0 references
    shortest paths
    0 references
    spanners
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references