Computing the eccentricity distribution of large graphs

DOI10.3390/a6010100zbMath1462.05128OpenAlexW2070017344MaRDI QIDQ1736547

Walter A. Kosters, Frank W. Takes

Publication date: 26 March 2019

Published in: Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/a6010100

zbMATH Keywords

centerdiametereccentricityradiusperiphery

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Multiaspect graphs: algebraic representation and algorithms ⋮ Eccentricity queries and beyond using hub labels ⋮ A faster diameter problem algorithm for a chordal graph, with a connection to its center problem ⋮ Editorial: Special issue on graph algorithms ⋮ Constructing uniform central graphs and embedding into them ⋮ Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs

Uses Software

• ANF

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On computing the diameter of real-world undirected graphs
• A note on coloring sparse random graphs
• Eccentric sequences in graphs
• Relaxing the uniformity and independence assumptions using the concept of fractal dimension
• A faster algorithm for betweenness centrality*
• A Comparison of Three Algorithms for Approximating the Distance Distribution in Real-World Graphs
• Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters
• The small-world phenomenon
• Fast computation of empirically tight bounds for the diameter of massive graphs
• Machine Learning: ECML 2004