268 search results - page 3 / 54 » Cleaning Interval Graphs |
112
Voted
CORR
2006
Springer
15 years 2 months ago
2006
Springer
We present a linear time algorithm for the minimum linear arrangement problem on proper interval graphs. The obtained ordering is a 4-approximation for general interval graphs. 1 ...
126
Voted
ISAAC
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. In this paper, the space requirements for the OBDD representation of certain graph classes, specifically cographs, several types of graphs with few P4s, unit interval gr...
123
Voted
CAAN
2007
Springer
15 years 8 months ago
2007
Springer
In the recently introduced model for cleaning a graph with brushes, we use a degree-greedy algorithm to clean a random d-regular graph on n vertices (with dn even). We then use a d...
133
Voted
DAWAK
2011
Springer
14 years 2 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...
114
Voted
VISUALIZATION
2000
IEEE
15 years 7 months ago
2000
IEEE
We present a new approach to surface reconstruction based on the Delaunay complex. First we give a simple and fast algorithm that picks locally a surface at each vertex. For that,...