activity
20052010
most citedThe 1-fixed-endpoint Path Cover Problem is Polynomial on Interval Graph

2 citations · 2 across the 4 of their papers we have counts for

collaborators
Showing cs.DSShow all

2 papers · 1 filter

cs.DS2010

Join-Reachability Problems in Directed Graphs

Loukas Georgiadis, Stavros D. Nikolopoulos, Leonidas Palios

For a given collection G of directed graphs we define the join-reachability graph of G, denoted by J(G), as the directed graph that, for any pair of vertices a and b, contains a pa…

cs.DS2008★ 2 cited

The 1-fixed-endpoint Path Cover Problem is Polynomial on Interval Graph

Katerina Asdre, Stavros D. Nikolopoulos

We consider a variant of the path cover problem, namely, the -fixed-endpoint path cover problem, or kPC for short, on interval graphs. Given a graph and a subset $\mathcal{T…