Embedding grids in surfaces

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Embedding grids in surfaces

We show that if a very large grid is embedded in a surface, then a large subgrid is embedded in a disc in the surface. This readily implies that: (a) a minor-minimal graph that does not embed in a given surface has no very large grid; and (b) a minor-minimal k-representative embedding in the surface has no very large grid. Similar arguments show (c) that if G is minimal with respect to crossing...

متن کامل

Embedding of Hypercubes into Grids

We consider one-to-one embeddings of the n-dimensional hypercube into grids with 2n vertices and present lower and upper bounds and asymptotic estimates for minimal dilation, edge-congestion, and their mean values. We also introduce and study two new cost-measures for such embeddings, namely the sum over i = 1, ..., n of dilations and the sum of edge congestions caused by the hypercube edges of...

متن کامل

Embedding Lagrangian Sink Particles in Eulerian Grids

We introduce a new computational method for embedding Lagrangian sink particles into an Eulerian calculation. Simulations of gravitational collapse or accretion generally produce regions whose density greatly exceeds the mean density in the simulation. These dense regions require extremely small time steps to maintain numerical stability. Smoothed particle hydrodynamics (SPH) codes approach thi...

متن کامل

Embedding Bayesian Networks in Sensor Grids

In their simplest form, sensors are transducers that convert physical phenomena into electrical signals. By combining recent innovations in wireless technology, distributed computing, and transducer design, grids of sensors equipped with wireless communication can monitor large geographical areas. However, just getting the data is not enough. In order to react intelligently to the dynamics of t...

متن کامل

Embedding grids into grids: Techniques for large compression ratios

We return to the problem of embedding 2-dimensional (h × w ) guest grid graphs into 2dimensional (h ′ × w ′) host grid graphs, where w ′ < w , and h ′ is the smallest integer such that hw ≤ h ′w ′. This 2-dimensional problem has many applications in computer science including the simulation of one grid of processors by another of different shape. Also, it can likely be applied to more complex p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: European Journal of Combinatorics

سال: 2004

ISSN: 0195-6698

DOI: 10.1016/j.ejc.2003.07.007