Tight Paths and Tight Pairs in Weighted Directed Graphs

TL;DR

This paper investigates the problem of finding tight paths and pairs in weighted directed graphs, motivated by data analysis applications, and compares various algorithms for solving these problems.

Contribution

It formalizes the problem of tight paths and pairs in weighted directed graphs and provides a comparative analysis of different algorithms to solve them.

Findings

Several algorithms for finding tight paths and pairs are discussed.

The paper highlights the relevance of these problems in data analysis.

Comparison results indicate the strengths and weaknesses of each approach.

Abstract

We state the graph-theoretic computational problem of finding tight paths in a directed, edge-weighted graph, as well as its simplification of finding tight pairs. These problems are motivated by the need of algorithms that find so-called basic antecedents in closure spaces, in one specific approach to data analysis. We discuss and compare several algorithms to approach these problems.