Given a directed graph, we show how to efficiently find a shortest (dire...
We systematically investigate the complexity of counting subgraph patter...
Given an undirected graph and two disjoint vertex pairs s_1,t_1 and
s_2,...
We show that the eccentricities, diameter, radius, and Wiener index of a...
We devise an algorithm that approximately computes the number of paths o...