In this paper we study the problems of detecting holes and antiholes in general undirected graphs, and we present algorithms for these problems. For an input graph G on n vertices ...
The problem of characterizing all the testable graph properties is considered by many to be the most important open problem in the area of property-testing. Our main result in thi...
Graphs are well-known, well-understood, and frequently used means to depict networks of related items. They are successfully used as the underlying mathematical concept in various ...
Given a graph database D and a query graph g, an exact subgraph matching query asks for the set S of graphs in D that contain g as a subgraph. This type of queries find important...
Changjiu Jin, Sourav S. Bhowmick, Xiaokui Xiao, Ja...
This paper proposes a stream authentication method based on the Generalized Butterfly Graph (GBG) framework. Compared with the original Butterfly graph, the proposed GBG graph sup...
Zhishou Zhang, John G. Apostolopoulos, Qibin Sun, ...