A Fast Heuristic for Computing Geodesic Closures in Large Networks

Motivated by the increasing interest in applications of graph geodesic convexity in machine learning and data mining, we present a heuristic for approximating the geodesic convex hull of node sets in large networks. It generates a small set of (almost) maximal outerplanar spanning subgraphs for the input graph, computes the geodesic closure in each of these graphs, and regards a node as an element of the convex hull if it belongs to the closed sets for at least a user specified number of outerplanar graphs. Our heuristic algorithm runs in time linear in the number of edges of the input graph, i.e., it is faster with one order of magnitude than the standard algorithm computing the closure exactly. Its performance is evaluated empirically by approximating convexity based core-periphery decomposition of networks. Our experimental results with large real-world networks show that for most networks, the proposed heuristic was able to produce close approximations significantly faster than the standard algorithm computing the exact convex hulls. For example, while our algorithm calculated an approximate core-periphery decomposition in 5 h or less for networks with more than 20 million edges, the standard algorithm did not terminate within 50 days.

  • Published in:
    International Conference on Discovery Science
  • Type:
  • Authors:
    Seiffarth, Florian; Horváth, Tamás; Wrobel, Stefan
  • Year:

Citation information

Seiffarth, Florian; Horváth, Tamás; Wrobel, Stefan: A Fast Heuristic for Computing Geodesic Closures in Large Networks, International Conference on Discovery Science, 2022, https://link.springer.com/chapter/10.1007/978-3-031-18840-4_34, Seiffarth.etal.2022a,

Associated Lamarr Researchers

lamarr institute person Wrobel Stefan e1663925461852 - Lamarr Institute for Machine Learning (ML) and Artificial Intelligence (AI)

Prof. Dr. Stefan Wrobel

Director to the profile