Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Algorithms and Computation

WALCOM 2018: WALCOM: Algorithms and Computation pp 228–239Cite as

On Structural Parameterizations of Happy Coloring, Empire Coloring and Boxicity

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10755))

Abstract

Distance parameters are extensively used to design efficient algorithms for many hard graph problems. They measure how far a graph is from belonging to some class of graphs. If a problem is tractable on a class of graphs , then distances to provide interesting parameterizations to that problem. For example, the parameter vertex cover measures the closeness of a graph to an edgeless graph. Many hard problems are tractable on graphs of small vertex cover. However, the parameter vertex cover is very restrictive in the sense that the class of graphs with bounded vertex cover is small. This significantly limits its usefulness in practical applications. In general, it is desirable to find tractable results for parameters such that the class of graphs with the parameter bounded should be as large as possible. In this spirit, we consider the parameter distance to threshold graphs, which are graphs that are both split graphs and cographs. It is a natural choice of an intermediate parameter between vertex cover and clique-width. In this paper, we give parameterized algorithms for some hard graph problems parameterized by the distance to threshold graphs. We show that Happy Coloring and Empire Coloring problems are fixed-parameter tractable when parameterized by the distance to threshold graphs. We also present an approximation algorithm to compute the Boxicity of a graph parameterized by the distance to threshold graphs.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Notes

  1. 1.

    A coloring is optimal if it maximizes the number of happy vertices.

References

  1. Adiga, A., Chitnis, R., Saurabh, S.: Parameterized algorithms for boxicity. In: Cheong, O., Chwa, K.-Y., Park, K. (eds.) ISAAC 2010. LNCS, vol. 6506, pp. 366–377. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-17517-6_33

    Chapter  Google Scholar 

  2. Agrawal, A.: On the parameterized complexity of happy vertex coloring. In: International Workshop on Combinatorial Algorithms. Springer (2017, in press)

    Google Scholar 

  3. Aravind, N.R., Kalyanasundaram, S., Kare, A.S.: Linear time algorithms for happy vertex coloring problems for trees. In: Mäkinen, V., Puglisi, S.J., Salmela, L. (eds.) IWOCA 2016. LNCS, vol. 9843, pp. 281–292. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-44543-4_22

    Chapter  Google Scholar 

  4. Aravind, N., Kalyanasundaram, S., Kare, A.S., Lauri, J.: Algorithms and hardness results for happy coloring problems. arXiv preprint arXiv:1705.08282 (2017)

  5. Brandstädt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. SIAM (1999)

    Google Scholar 

  6. Bruhn, H., Chopin, M., Joos, F., Schaudt, O.: Structural parameterizations for boxicity. Algorithmica 74(4), 1453–1472 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  7. Bulian, J.: Parameterized complexity of distances to sparse graph classes. Technical report, University of Cambridge, Computer Laboratory (2017)

    Google Scholar 

  8. Cai, L.: Parameterized complexity of vertex colouring. Discrete Appl. Math. 127(3), 415–429 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  9. Courcelle, B.: The monadic second-order logic of graphs. I. recognizable sets of finite graphs. Inf. Comput. 85(1), 12–75 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  10. Cozzens, M.B.: Higher and multi-dimensional analogues of interval graphs (1982)

    Google Scholar 

  11. Cygan, M., Fomin, F.V., Kowalik, L., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-21275-3

    Book  MATH  Google Scholar 

  12. Das, B., Enduri, M.K., Misra, N., Reddy, I.V.: On structural parameterizations of graph Motif and Chromatic number. In: Gaur, D., Narayanaswamy, N.S. (eds.) CALDAM 2017. LNCS, vol. 10156, pp. 118–129. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-53007-9_11

    Chapter  Google Scholar 

  13. Doucha, M., Kratochvíl, J.: Cluster vertex deletion: a parameterization between vertex cover and clique-width. In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS 2012. LNCS, vol. 7464, pp. 348–359. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-32589-2_32

    Chapter  Google Scholar 

  14. Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity, vol. 4. Springer, London (2013). https://doi.org/10.1007/978-1-4471-5559-1

    Book  MATH  Google Scholar 

  15. Guo, J., Hüffner, F., Niedermeier, R.: A structural view on parameterizing problems: distance from triviality. In: Downey, R., Fellows, M., Dehne, F. (eds.) IWPEC 2004. LNCS, vol. 3162, pp. 162–173. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-28639-4_15

    Chapter  Google Scholar 

  16. Hartung, S., Komusiewicz, C., Nichterlein, A., Suchỳ, O.: On structural parameterizations for the 2-club problem. Discrete Appl. Math. 185, 79–92 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  17. Heawood, P.J.: Map-colour theorem. Proc. London Math. Soc. s2–51(1), 161–175 (1949)

    Article  MathSciNet  MATH  Google Scholar 

  18. Lampis, M.: Structural parameterizations of hard graph problems. City University of New York (2011)

    Google Scholar 

  19. Mahadev, N.V., Peled, U.N.: Threshold Graphs and Related Topics, vol. 56. Elsevier, Amsterdam (1995)

    MATH  Google Scholar 

  20. McGrae, A.R., Zito, M.: The complexity of the empire colouring problem. Algorithmica 68(2), 483–503 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  21. Misra, N., Reddy, I.V.: The parameterized complexity of happy colorings. arXiv preprint arXiv:1708.03853 (2017)

  22. Roberts, S.: On the boxicity and cubicity of a graph. In: Recent Progresses in Combinatorics, pp. 301–310 (1969)

    Google Scholar 

  23. Zhang, P., Li, A.: Algorithmic aspects of homophyly of networks. Theor. Comput. Sci. 593, 117–131 (2015)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

The authors are grateful to the anonymous referees for their valuable remarks and suggestions that significantly helped them improve the quality of the paper. The first author acknowledges support from Tata Consultancy Services (TCS) Research Fellowship.

Author information

Authors and Affiliations

  1. IIT Gandhinagar, Gandhinagar, India

    Jayesh Choudhari & I. Vinod Reddy

Authors
  1. Jayesh Choudhari
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. I. Vinod Reddy
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to I. Vinod Reddy .

Editor information

Editors and Affiliations

  1. Bangladesh University of Engineering and Technology, Dhaka, Bangladesh

    M. Sohel Rahman

  2. National University of Singapore , Singapore, Singapore

    Wing-Kin Sung

  3. Japan Advanced Institute of Science and Technology, Ishikawa, Japan

    Ryuhei Uehara

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Choudhari, J., Reddy, I.V. (2018). On Structural Parameterizations of Happy Coloring, Empire Coloring and Boxicity. In: Rahman, M., Sung, WK., Uehara, R. (eds) WALCOM: Algorithms and Computation. WALCOM 2018. Lecture Notes in Computer Science(), vol 10755. Springer, Cham. https://doi.org/10.1007/978-3-319-75172-6_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-75172-6_20

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-75171-9

  • Online ISBN: 978-3-319-75172-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation