Computing the Eccentricity Distribution of Large Graphs

Author： Takes Frank W.   Kosters Walter A.  

Publisher： MDPI

E-ISSN： 1999-4893|6|1|100-118

ISSN： 1999-4893

Source： Algorithms, Vol.6, Iss.1, 2013-02, pp. : 100-118

Access to resources Favorite

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

An Effective and Efficient MapReduce Algorithm for Computing BFS-Based Traversals of Large-Scale RDF Graphs

By Cuzzocrea Alfredo   Cosulschi Mirel   de Virgilio Roberto  

Algorithms, Vol. 9, Iss. 1, 2016-01 ,pp. : 7-7

MDPI

Access to resources Recommend Favorite

How Symmetric Are Real-World Graphs? A Large-Scale Study

By Ball Fabian   Geyer-Schulz Andreas  

Symmetry, Vol. 10, Iss. 1, 2018-01 ,pp. : 29-29

MDPI

Access to resources Recommend Favorite

A Polynomial-Time Algorithm for Computing the Maximum Common Connected Edge Subgraph of Outerplanar Graphs of Bounded Degree

By Akutsu Tatsuya   Tamura Takeyuki  

Algorithms, Vol. 6, Iss. 1, 2013-02 ,pp. : 119-135

MDPI

Access to resources Recommend Favorite

On Center, Periphery and Average Eccentricity for the Convex Polytopes

By Nazeer Waqas   Kang Shin Min   Nazeer Saima   Munir Mobeen   Kousar Imrana   Sehar Ammara   Kwun Young Chel  

Symmetry, Vol. 8, Iss. 12, 2016-12 ,pp. : 145-145

MDPI

Access to resources Recommend Favorite

Duality in Geometric Graphs: Vector Graphs, Kirchhoff Graphs and Maxwell Reciprocal Figures

By Reese Tyler   Paffenroth Randy   Fehribach Joseph D.  

Symmetry, Vol. 8, Iss. 3, 2016-02 ,pp. : 9-9

MDPI

Access to resources Recommend Favorite