The notion of graph which is most useful in computer science is that of a directed graph or
just a graph. A graph is a combinatorial structure consisting of a finite nonempty set of …

Graphs are natural candidates for modeling application domains, such as social networks,
pattern recognition, citation networks, or protein–protein interactions. One of the most …

An approach is provided for providing standard information processing pipelines. A standard
pipeline generation platform processes and/or facilitates a processing of one or more …

Graph simulation is one of the most important queries in graph pattern matching, and it is
being increasingly used in various applications, eg, protein interaction networks, software …

In this paper an extension to index-based subgraph matching is proposed. This extension
significantly speeds up the indexing time for graphs where the nodes are labeled with a …

This paper proposes two efficient kernels for comparing acyclic, directed graphs. The first
kernel counts the number of common paths and allows for weighing according to path …

Graphs play a major role in many applications in business, science, and social sciences
allowing modeling and analysis of interactions among objects and their structural …

We study an approximation algorithm with a performance guarantee to solve a new NP NP-
hard optimization problem on planar graphs. The problem, which is referred to as the …

A subset of vertices of an undirected graph is a hub cover when for each edge, at least one
of its endpoints belongs to, or there exists a vertex that is a neighbor of both and. The …

In this paper, we present an improved and novel directed graph matching algorithm, called
CodeBlast, for searching functionally similar program segments in software repositories with …