717 search results - page 51 / 144 » The Viewing Graph |
APPROX
2006
Springer
14 years 1 months ago
2006
Springer
In this paper we relate the problem of finding structures related to perfect matchings in bipartite graphs to a stochastic process similar to throwing balls into bins. Given a bip...
JGAA
2002
13 years 9 months ago
2002
The merit of automatic graph layout algorithms is typically judged by their computational efficiency and the extent to which they conform to aesthetic criteria (for example, minim...
ADBIS
2009
Springer
14 years 4 months ago
2009
Springer
In this paper, we visit the problem of the management of inconsistencies emerging on ETL processes as results of evolution operations g at their sources. We abstract Extract-Transf...
STOC
2006
ACM
14 years 4 months ago
2006
ACM
It has been known for some time that graph isomorphism reduces to the hidden subgroup problem (HSP). What is more, most exponential speedups in quantum computation are obtained by...
COMPGEOM
2011
ACM
13 years 1 months ago
2011
ACM
Many real-world data sets can be viewed of as noisy samples of special types of metric spaces called metric graphs [16]. Building on the notions of correspondence and GromovHausdo...