Fast computation of empirically tight bounds for the diameter of massive graphs (Q5406179): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / OpenAlex ID
 
Property / OpenAlex ID: W2034050320 / rank
 
Normal rank

Revision as of 20:40, 19 March 2024

scientific article; zbMATH DE number 6276637
Language Label Description Also known as
English
Fast computation of empirically tight bounds for the diameter of massive graphs
scientific article; zbMATH DE number 6276637

    Statements

    Fast computation of empirically tight bounds for the diameter of massive graphs (English)
    0 references
    0 references
    0 references
    0 references
    1 April 2014
    0 references
    diameter bounds
    0 references
    graph diameter
    0 references

    Identifiers

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