We introduce visual graphs as an intermediate repren between concrete visual syntax and abstract graph syntax. In a visual graph some nodes are shown as geometric figures, and som...
—This paper presents an approximate Maximum Common Subgraph (MCS) algorithm, specifically for directed, cyclic graphs representing digital circuits. Because of the application d...
Jochem H. Rutgers, Pascal T. Wolkotte, Philip K. F...
Existing frequent subgraph mining algorithms can operate efficiently on graphs that are sparse, have vertices with low and bounded degrees, and contain welllabeled vertices and edg...
Several bioinformatics data sets are naturally represented as graphs, for instance gene regulation, metabolic pathways, and proteinprotein interactions. The graphs are often large ...
Abstract. Social Network (SN) data has become ubiquitous, demanding advanced and flexible means to represent, transform and query such data. In addition to the intrinsic challenge...