1883 search results - page 77 / 377 » Ordered theta graphs |
WG
1998
Springer
13 years 12 months ago
1998
Springer
In this work we introduce the class of graphs with bounded induced distance of order k, (BID(k) for short). A graph G belongs to BID(k) if the distance between any two nodes in ev...
ICDT
1997
ACM
13 years 12 months ago
1997
ACM
We develop a new schema for unstructured data. Traditional schemas resemble the type systems of programming languages. For unstructured data, however, the underlying type may be mu...
ICONIP
2008
13 years 9 months ago
2008
Abstract. Internet literature queries return a long lists of citations, ordered according to their relevance or date. Query results may also be represented using Visual Language th...
DAM
2006
13 years 7 months ago
2006
The aim of edge modification problems is to change the edge set of a given graph as little as possible in order to satisfy a certain property. Edge modification problems in graphs...
DAWAK
2011
Springer
12 years 7 months ago
2011
Springer
Data cleaning and ETL processes are usually modeled as graphs of data transformations. The involvement of the users responsible for executing these graphs over real data is importa...