Effectively Counting s-t Simple Paths in Directed Graphs

An important tool in analyzing complex social and information networks is s-t simple path counting, which is known to be #P-complete. In this paper, we study efficient s-t simple path counting in directed graphs. For a given pair of vertices s and t in a directed graph, first we propose a pruning technique that can efficiently and considerably reduce the search space. Then, we discuss how this technique can be adjusted with exact and approximate algorithms, to improve their efficiency. In the end, by performing extensive experiments over several networks from different domains, we show high empirical efficiency of our proposed technique. Our algorithm is not a competitor of existing methods, rather, it is a friend that can be used as a fast pre-processing step, before applying any existing algorithm.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/01/2022

Counting Dominating Sets in Directed Path Graphs

A dominating set of a graph is a set of vertices such that every vertex ...
research
04/14/2023

Finding A Path Of Length k: An Expository

Given a graph G(V, E) and a positive integer k (k ≥ 1), a simple path on...
research
02/24/2022

Counting Temporal Paths

The betweenness centrality of a vertex v is an important centrality meas...
research
07/28/2020

Efficient Sampling Algorithms for Approximate Temporal Motif Counting (Extended Version)

A great variety of complex systems ranging from user interactions in com...
research
10/23/2018

Novel Adaptive Algorithms for Estimating Betweenness, Coverage and k-path Centralities

An important index widely used to analyze social and information network...
research
01/27/2020

An efficient algorithm for 1-dimensional (persistent) path homology

This paper focuses on developing an efficient algorithm for analyzing a ...
research
01/29/2023

Fast Correlation Function Calculator – A high-performance pair counting toolkit

Context. A novel high-performance exact pair counting toolkit called Fas...

Please sign up or login with your details

Forgot password? Click here to reset