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

Full description

Bibliographic Details

Published in:	Information processing letters Vol. 171; p. 106137
Main Author:	Ohsaka, Naoto
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.10.2021
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!