Abstract
We investigate embeddings of graphs into the infinite extended grid graph. The problem was motivated by computation on adiabatic quantum computers, but it is related to a number of other well studied grid embedding problems. Such problems typically deal with representing vertices by grid points, and edges by grid paths, while minimizing some objective function such as the area or the maximum length of the grid paths representing the edges. Our particular model, while expressible in this language, is more naturally viewed as one where the vertices are represented by subtrees of the grid (called islands), and the edges are represented by the usual grid edges joining the islands. Somewhat unexpectedly, these graphs turn out to unify such seemingly unrelated graph classes as the string graphs and the induced subgraphs of the extended grid. The connection is established by limiting the size (number of vertices) k of the representing islands. We study the problem of representability of an input graph G by islands of size at most k. We conjecture that this problem is NP-complete for any positive integer k, and prove the conjecture for k < 3 and k > 5; the cases k = 3, 4, 5 remain open.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aharonov, D., van Dam, W., Kempe, J., Landau, Z., Lloyd, S., Regev, O.: Adiabatic quantum computation is equivalent to standard quantum computation. In: Proceedings of the 45th FOCS, pp. 42–51 (2004)
Amin, M.H.S., Love, P.J., Truncik, C.J.S.: Thermally assisted adiabatic quantum computation. Physical Review Letters 100, 060503 (2008)
Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing. Prentice-Hall, Englewood Cliffs (1999)
Benzer, S.: On the topology of the genetic fine structure. Proceedings of the National Academy of Sciences of USA 45, 1607–1620 (1959)
Bhatt, S.N., Leighton, F.T.: A framework for solving VLSI and graph layout problems. J. Comput. System Sciences 28, 300–343 (1984)
Bhatt, S.N., Cosmadakis, S.S.: The complexity of minimizing wire length in VLSI layouts. Inform. Process. Lett. 25, 263–267 (1987)
Eades, P., Whitesides, S.: Nearest neighbour graph realizability is NP-hard. In: Baeza-Yates, R., Poblete, P.V., Goles, E. (eds.) LATIN 1995. LNCS, vol. 911, pp. 245–256. Springer, Heidelberg (1995)
Eppstein, D.: Isometric Diamond Subgraphs. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol. 5417, pp. 384–389. Springer, Heidelberg (2009)
Farhi, E., Goldstone, J., Gutmann, S., Sipser, M.: Quantum computation by adiabatic evolution (2000), http://arxiv.org/abs/quant-ph/0001106
Formann, M., Wagner, F.: The VLSI layout problem in various embedding models. In: Möhring, R.H. (ed.) WG 1990. LNCS, vol. 484, pp. 130–139. Springer, Heidelberg (1991)
Garey, M.R., Johnson, D.S., So, H.C.: An application of graph coloring to printed circuit testing. IEEE Trans. on Circuits and Systems 23, 591–599 (1976)
Kratochvíl, J.: String graphs II. Recognizing string graphs is NP-hard. J. Comb. Theory, Ser. B 52, 67–78 (1991)
Kratochvíl, J.: String graphs requiring exponential representations. J. Comb. Theory, Ser. B 53, 1–4 (1991)
Kratochvíl, J.: A Special Planar Satisfiability Problem and a Consequence of its NP-completeness. Discr. Appl. Math. 52, 233–252 (1994)
Leighton, F.T.: Introduction to parallel algorithms and architectures. Morgan Kaufmann, San Mateo (1993)
Lin, Y.B., Miller, Z., Perkel, M., Pritikin, D., Sudborough, I.H.: Expansion of layouts of complete binary trees into grids. Discr. Appl. Math. 131, 611–642 (2003)
Matsubayashi, A.: VLSI layout of tree into grids of minimum width. In: Proc. 15th Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 75–84 (2003)
Opatrny, J., Sotteau, D.: Embeddings of complete binary trees into grids and extended grids with total vertex-congestion 1. Discr. Appl. Math. 98, 237–254 (2000)
Rose, G., Bunyk, P., Coury, M.D., Macready, W., Choi, V.: Systems, Devices, and Methods for Interconnected Processor Topology, US Patent Application No. 20080176750 (January 2008)
Schaefer, M., Sedgwick, E., Stefankovic, D.: Recognizing string graphs in NP. J. Comput. Syst. Sci. 67, 365–380 (2003)
Sinden, A.: Topology of thin film RC-circuits. Bell System Technical Journal, 1639–1662 (1966)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Coury, M.D., Hell, P., Kratochvíl, J., Vyskočil, T. (2010). Faithful Representations of Graphs by Islands in the Extended Grid. In: López-Ortiz, A. (eds) LATIN 2010: Theoretical Informatics. LATIN 2010. Lecture Notes in Computer Science, vol 6034. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12200-2_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-12200-2_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12199-9
Online ISBN: 978-3-642-12200-2
eBook Packages: Computer ScienceComputer Science (R0)