Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs (Q2347002): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for center problems in cactus networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network analysis. Methodological foundations. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better Approximation Algorithms for the Graph Diameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameter determination on restricted graph families / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of BFS to determine a graph's diameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computing the diameter of real-world undirected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5572939 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which problems have strongly exponential complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Is the Boston subway a small-world network? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast computation of empirically tight bounds for the diameter of massive graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis and enumeration. Algorithms for biological graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Structure and Function of Complex Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast approximation algorithms for the diameter and radius of sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the eccentricity distribution of large graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4869540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplying matrices faster than coppersmith-winograd / rank
 
Normal rank

Latest revision as of 03:49, 10 July 2024

scientific article
Language Label Description Also known as
English
Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs
scientific article

    Statements

    Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    26 May 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    graph diameter
    0 references
    graph radius
    0 references
    actors graph
    0 references
    Wikipedia graph
    0 references
    0 references
    0 references
    0 references
    0 references