Computing the Diameters of Huge Social Networks

No abstract is available for this paper.

• Publication year

  2016

• Venue

  International Conference on Supercomputing

• Publication date

  2016-12-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1109/ICS.2016.0011
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs: With an application to the six degrees of separation games

  2015cited by this paper
• On computing the diameter of real-world undirected graphs

  2013influential reference
• Determining the diameter of small world networks

  2011cited by this paper
• Fast computation of empirically tight bounds for the diameter of massive graphs

  2009cited by this paper
• Network Science: Theory and Applications

  2009cited by this paper
• Network clustering coefficient without degree-correlation biases.

  2005cited by this paper
• Introduction to algorithms

  1996influential reference
• On the All-Pairs-Shortest-Path Problem in Unweighted Undirected Graphs

  1995cited by this paper
• Social Network Analysis: Methods and Applications

  1994cited by this paper

• Behind the wheel of progress: Innovation factor allocation patterns of collaborative innovation in electric vehicles

  2026cites this paper
• On Diameter Approximation in Directed Graphs

  2023cites this paper
• Improved SETH-hardness of unweighted Diameter

  2020cites this paper
• Tight conditional lower bounds for approximating diameter in directed graphs

  2020cites this paper
• Settling SETH vs. approximate sparse directed unweighted diameter (up to (NU)NSETH)

  2020cites this paper
• Towards tight approximation bounds for graph diameter and eccentricities

  2018cites this paper