Abstract
Given a pair of non-negative integers m and n, S(m,n) denotes a square lattice graph with a vertex set {0,1,2,...,m – 1} × {0,1,2,...,n – 1}, where a pair of two vertices is adjacent if and only if the distance is equal to 1. A triangular lattice graph T(m,n) has a vertex set {(xe 1 + ye 2) | x ∈ {0,1,2,...,m − 1}, y ∈ {0,1,2,...,n − 1}} where \(e_1 = (1,0), e_2 = (1/2, \sqrt{3}/2)\), and an edge set consists of a pair of vertices with unit distance. Let S k(m,n) and T k(m,n) be the kth power of the graph S(m,n) and T(m,n), respectively. Given an undirected graph G = (V,E) and a non-negative vertex weight function \(w : V \longrightarrow Z_+\), a multicoloring of G is an assignment of colors to V such that each vertex v ∈ V admits w(v) colors and every adjacent pair of two vertices does not share a common color.
In this paper, we show necessary and sufficient conditions that [∀ m, theS k(m,n) is perfect] and/or [∀ m, T k(m,n) is perfect], respectively. These conditions imply polynomial time approximation algorithms for multicoloring (S k(m,n),w) and (T k(m,n),w).
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
Dilworth, R.P.: A decomposition theorem for partially ordered sets. Annals of Mathematics 51, 161–166 (1950)
Gerke, S., McDiarmid, C.: Graph Imperfection. Journal of Combinatorial Theory B 83, 58–78 (2001)
Gerke, S., McDiarmid, C.: Graph Imperfection II. Journal of Combinatorial Theory B 83, 79–101 (2001)
Halldórsson, M.M., Kortsarz, G.: Tools for Multicoloring with Applications to Planar Graphs and Partial k-Trees. Journal of Algorithms 42, 334–366 (2002)
Hochbaum, D.S.: Efficient bounds for the stable set, vertex cover and set packing problems. Discrete Applied Mathematics 6, 243–254 (1983)
McDiarmid, C., Reed, B.: Channel Assignment and Weighted Coloring. Networks 36, 114–117 (2000)
McDiarmid, C.: Discrete Mathematics and Radio Channel Assignment. Appears in Recent Advances in Algorithms and Combinatorics. Springer, Heidelberg (2003)
Miyamoto, Y., Matsui, T.: Linear Time Approximation Algorithm for Multicoloring Lattice Graphs with Diagonals. Journal of the Operations Research Society of Japan 47, 123–128 (2004)
Miyamoto, Y., Matsui, T.: Multicoloring Unit Disk Graphs on Triangular Lattice Points. In: Proceedings of the Sixteenth ACM-SIAM Symposium on Discrete Algorithms (to appear)
Narayanan, L., Shende, S.M.: Static Frequency Assignment in Cellular Networks. Algorithmica 29, 396–409 (2001)
Schrijver, A.: Combinatorial Optimization. Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Miyamoto, Y., Matsui, T. (2005). Perfectness and Imperfectness of the kth Power of Lattice Graphs. In: Megiddo, N., Xu, Y., Zhu, B. (eds) Algorithmic Applications in Management. AAIM 2005. Lecture Notes in Computer Science, vol 3521. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11496199_26
Download citation
DOI: https://doi.org/10.1007/11496199_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26224-4
Online ISBN: 978-3-540-32440-9
eBook Packages: Computer ScienceComputer Science (R0)