Detecting clusters or communities in large real-world graphs such as large social or information networks is a problem of considerable interest. In practice, one typically chooses...
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khann...
Source code analysis and inspection does not provide enough information to describe the structure of an objectoriented program completely because there are components and relation...
This article presents a new algorithm for spatial deinterlacing that could easily be integrated in a more complete deinterlacing system. The spatial interpolation process often fa...
Recently, a generic approach for syntax-based user assistance in diagram editors has been proposed that requires the syntax of the visual language to be defined by a graph grammar...