• KADABRA

  • Referenced in 4 articles [sw25810]
  • KADABRA, a new algorithm to approximate betweenness centrality in directed and undirected graphs, which significantly ... used by most algorithms that approximate betweenness centrality. We show that, on realistic random graph ... sampled to compute all betweenness centralities with a given absolute error, and it also handles...
  • Elixir

  • Referenced in 2 articles [sw25435]
  • search, single source shortest path, and betweenness-centrality computation. Our experiments show that the best...
  • GraphCT

  • Referenced in 1 article [sw06629]
  • minutes. We can estimate the betweenness centrality of a similar graph with 537 million vertices...
  • SociaLite

  • Referenced in 1 article [sw32549]
  • connected components, triangles, clustering coefficients, and betweenness centrality) on two real-life social graphs, Live...
  • TrajGraph

  • Referenced in 3 articles [sw38749]
  • original street-level graph. Graph centralities, including Pagerank and betweenness, are computed to characterize...
  • NETAL

  • Referenced in 2 articles [sw06628]
  • important kernel types called shortest paths and centrality. Our implementation, called NETAL (NETwork Analysis Library ... GraphCT took 18 hours to compute the betweenness of web-BerkStan ... implementation computed multiple centrality metrics (closeness, graph, stress, and betweenness) simultaneously within 1 hour...
  • mcl-edge

  • Referenced in 0 articles [sw05582]
  • shortest paths, diameter, clustering coefficient, betweenness centrality, and network shuffles. A module for loading...
  • UNA

  • Referenced in 3 articles [sw31603]
  • types of network centrality measures on spatial networks: Reach; Gravity Index; Betweenness; Closeness; and Straightness ... networks, or utility networks. Unlike previous network centrality tools that operate with two network elements...
  • SocNetV

  • Referenced in 1 article [sw05578]
  • such as node and network centralities (i.e. closeness, betweenness, graph), clustering coefficient...
  • LEDA

  • Referenced in 263 articles [sw00509]
  • In the core computer science areas -- data structures...
  • R

  • Referenced in 9969 articles [sw00771]
  • R is a language and environment for statistical...
  • GraphBase

  • Referenced in 135 articles [sw01555]
  • The Stanford GraphBase is a freely available collection...
  • UCI-ml

  • Referenced in 3403 articles [sw04074]
  • UC Irvine Machine Learning Repository. We currently maintain...
  • CPLEX

  • Referenced in 2773 articles [sw04082]
  • IBM® ILOG® CPLEX® offers C, C++, Java, .NET...
  • SNAP

  • Referenced in 171 articles [sw04184]
  • Stanford Network Analysis Platform (SNAP) is a general...
  • XPRESS

  • Referenced in 230 articles [sw04834]
  • FICO Xpress is the premier mathematical modeling and...
  • PORTA

  • Referenced in 126 articles [sw04869]
  • PORTA is a collection of routines for analyzing...