Tight Paths and Tight Pairs in Weighted Directed Graphs
Data Structures and Algorithms
2025-06-12 v1 Discrete Mathematics
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.
Cite
@article{arxiv.2506.09966,
title = {Tight Paths and Tight Pairs in Weighted Directed Graphs},
author = {José Luis Balcázar},
journal= {arXiv preprint arXiv:2506.09966},
year = {2025}
}