— For efficient video data management, ‘video data mining’ is required to discover ‘semantic patterns’ which are not only previously unknown and interesting, but also as...
We consider the problems of enumerating all minimal strongly connected subgraphs and all minimal dicuts of a given directed graph G = (V, E). We show that the first of these proble...
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvic...
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
We deal with the search process of the GraphPlan algorithm in this paper. We concentrate on a problem of finding supports for a sub-goal which arises during the search. We model t...
How do connected components evolve? What are the regularities that govern the dynamic growth process and the static snapshot of the connected components? In this work, we study pat...
U. Kang, Mary McGlohon, Leman Akoglu, Christos Fal...