Mining for frequent subgraphs in a graph database has become a popular topic in the last years. Algorithms to solve this problem are used in chemoinformatics to find common molecul...
A tournament sequence is an increasing sequence of positive integers (t1, t2, . . .) such that t1 = 1 and ti+1 2ti. A Meeussen sequence is an increasing sequence of positive inte...
Graph pattern matching is typically defined in terms of subgraph isomorphism, which makes it an np-complete problem. Moreover, it requires bijective functions, which are often to...
Wenfei Fan, Jianzhong Li, Shuai Ma, Nan Tang, Ying...
Abstract--This paper presents a novel and domainindependent approach for graph-based structure learning. The approach is based on solving the Maximum Common SubgraphIsomorphism pro...
Data exchange deals with inserting data from one database into another database having a different schema. We study and solve a central computational problem of data exchange, nam...