Embedding Graphs into the Extended Grid

Details Embedding Graphs into the Extended Grid Embedding Graphs into the Extended Grid

2007-02-28

arxiv.org/abs/cs/0703001v1

Computer Science

Discrete Mathematics

4 pages, 2 figures

Scientific paper

Let $G=(V,E)$ be an arbitrary undirected source graph to be embedded in a target graph $EM$, the extended grid with vertices on integer grid points and edges to nearest and next-nearest neighbours. We present an algorithm showing how to embed $G$ into $EM$ in both time and space $O(|V|^2)$ using the new notions of islands and bridges. An island is a connected subgraph in the target graph which is mapped from exactly one vertex in the source graph while a bridge is an edge between two islands which is mapped from exactly one edge in the source graph. This work is motivated by real industrial applications in the field of quantum computing and a need to efficiently embed source graphs in the extended grid.

Affiliated with

Also associated with

No associations

Rating

Embedding Graphs into the Extended Grid does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Embedding Graphs into the Extended Grid, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Embedding Graphs into the Extended Grid will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-119201