813 search results - page 42 / 163 » On the Boolean-Width of a Graph: Structure and Applications |
ICDE
2002
IEEE
14 years 10 months ago
2002
IEEE
Matching elements of two data schemas or two data instances plays a key role in data warehousing, e-business, or even biochemical applications. In this paper we present a matching...
TSE
2010
13 years 7 months ago
2010
This paper presents an innovative model of a program’s internal behavior over a set of test inputs, called the probabilistic program dependence graph (PPDG), that facilitates pr...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. Random intersection graphs (RIGs) are an important random structure with algorithmic applications in social networks, epidemic networks, blog readership, and wireless sen...
ENTCS
2007
13 years 9 months ago
2007
Reasoning about graph and model transformation systems is an important means to underpin model-driven software engineering, such as Model-Driven Architecture (MDA) and Model Integ...
PVLDB
2010
13 years 7 months ago
2010
In a variety of emerging applications one needs to decide whether a graph G matches another Gp, i.e., whether G has a topological structure similar to that of Gp. The traditional ...