Abstract
The paper studies a generalization of the Independent Set (IS) problem. A distance-d independent set for a positive integer d ≥ 2 in an unweighted graph G = (V, E) is a set S ⊆ V of vertices such that for any pair of vertices u, v ∈ S, the distance between u and v is at least d in G. Given an unweighted graph G and a positive integer k, the Distance- d Independent Set (D d IS) problem is to decide whether G contains a distance-d independent set S such that |S| ≥ k. D2IS is identical to the original IS and thus D2IS is in \({\cal P}\) for bipartite graphs and chordal graphs. In this paper, we show that for every fixed integer d ≥ 3, D d IS is \({\cal NP}\)-complete even for planar bipartite graphs of maximum degree three, and also \({\cal NP}\)-complete even for chordal bipartite graphs. Furthermore, we show that if the input graph is restricted to chordal graphs, then D d IS can be solved in polynomial time for any even d ≥ 2, whereas D d IS is \({\cal NP}\)-complete for any odd d ≥ 3.
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
Agnarsson, G., Damaschke, P., Halldórsson, M.H.: Powers of geometric intersection graphs and dispersion algorithms. Discrete Applied Mathematics 132, 3–16 (2004)
Agnarsson, G., Greenlaw, R., Halldórsson, M.M.: On powers of chordal graphs and their colorings. Congr. Numer. 144, 41–65 (2000)
Balakrishnan, R., Paulraja, P.: Powers of chordal graphs. Australian Journal of Mathematics, Series A 35, 211–217 (1983)
Brandstädt, A., Giakoumakis, V.: Maximum weight independent sets in hole- and co-chair-free graphs. Information Processing Letters 112, 67–71 (2012)
Brandstädt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. SIAM (1999)
Downey, R.G., Fellows, M.R.: Fixed-parameter tractability and completeness II: On completeness for W[1]. Theoretical Computer Science A 141(1-2), 109–131 (1995)
Flotow, C.: On powers of m-trapezoid graphs. Discrete Applied Mathematics 63, 187–192 (1995)
Flotow, C.: On powers of circular arc graphs and proper circular arc graphs. Discrete Applied Mathematics 74, 199–207 (1996)
Garey, M.R., Johnson, D.S., Stockmeyer, L.: Some simplified \({\cal NP}\)-complete graph problems. Theoretical Computer Science 1, 237–267 (1976)
Garey, M.R., Johnson, D.A.: Computers and intractability - A guide to the theory of \({\cal NP}\)-completeness (1979)
Gavril, F.: Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of chordal graph. SIAM J. Comput. 1, 180–187 (1972)
Gavril, F.: Algorithms on circular-arc graphs. Networks 4, 357–369 (1974)
Golumbic, M.C.: The complexity of comparability graph recognition and coloring. Computing 18, 199–208 (1977)
Harary, F.: Graph Theory. Addison-Wesley (1969)
Lozin, V.V., Milanič, M.: A polynomial algorithm to find an independent set of maximum weight in a fork-free graph. J. Discrete Algorithms 6, 595–604 (2008)
Minty, G.J.: On maximal independent sets of vertices in claw-free graphs. J. Combin. Theory Ser. B 28, 284–304 (1980)
Murphy, O.J.: Computing independent sets in graphs with large girth. Discrete Applied Mathematics 35, 167–170 (1992)
Poljak, S.: A note on stable sets and coloring of graphs. Comment. Math. Univ. Carolin. 15, 307–309 (1974)
Raychaudhuri, A.: On powers of interval and unit interval graphs. Congr. Numer. 459, 235–242 (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Eto, H., Guo, F., Miyano, E. (2012). Distance-d Independent Set Problems for Bipartite and Chordal Graphs. In: Lin, G. (eds) Combinatorial Optimization and Applications. COCOA 2012. Lecture Notes in Computer Science, vol 7402. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31770-5_21
Download citation
DOI: https://doi.org/10.1007/978-3-642-31770-5_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31769-9
Online ISBN: 978-3-642-31770-5
eBook Packages: Computer ScienceComputer Science (R0)