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...

Celý popis

Podrobná bibliografia

Vydané v:	Information processing letters Ročník 171; s. 106137
Hlavný autor:	Ohsaka, Naoto
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 01.10.2021
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!