A fully polynomial parameterized algorithm for counting the number of reachable vertices in a digraph

•We give an FPT algorithm for counting the number of reachable vertices in a digraph.•Our algorithm runs in truly subquadratic time if the feedback edge number is O(n13−ϵ).•The same result holds for vertex-weighted digraphs. We consider the problem of counting the number of vertices reachable from e...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Information processing letters Jg. 171; S. 106137
1. Verfasser: Ohsaka, Naoto
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier B.V 01.10.2021
Schlagworte:
FPT in P
Graph algorithms
Parameterized algorithms
Reachability
Transitive closure
Transitive closure
Parameterized algorithms
Graph algorithms
FPT in P
Reachability
ISSN:0020-0190, 1872-6119
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:•We give an FPT algorithm for counting the number of reachable vertices in a digraph.•Our algorithm runs in truly subquadratic time if the feedback edge number is O(n13−ϵ).•The same result holds for vertex-weighted digraphs. We consider the problem of counting the number of vertices reachable from each vertex in a digraph G, which is equal to computing all the out-degrees of the transitive closure of G. The current (theoretically) fastest algorithms run in quadratic time; however, Borassi has shown that this problem is not solvable in truly subquadratic time unless the Strong Exponential Time Hypothesis fails [Borassi, 2016 [13]]. In this paper, we present an O(f3n)-time exact algorithm, where n is the number of vertices in G and f is the feedback edge number of G. Our algorithm thus runs in truly subquadratic time for digraphs of f=O(n13−ϵ) for any ϵ>0, i.e., the number of edges is n plus O(n13−ϵ), and is fully polynomial fixed parameter tractable, the notion of which was first introduced by Fomin et al. (2018) [22]. We also show that the same result holds for vertex-weighted digraphs, where the task is to compute the total weights of vertices reachable from each vertex.
ISSN:0020-0190
1872-6119
DOI:10.1016/j.ipl.2021.106137