Advertisement

Graph coloring: a novel heuristic based on trailing path—properties, perspective and applications in structured networks

  • Abhirup Bandyopadhyay
  • Amit kumar Dhar
  • Sankar BasuEmail author
Methodologies and Application
  • 6 Downloads

Abstract

Graph coloring is a manifestation of graph partitioning, wherein a graph is partitioned based on the adjacency of its elements. The fact that there is no general efficient solution to this problem that may work unequivocally for all graphs opens up the realistic scope for combinatorial optimization algorithms to be invoked. The algorithmic complexity of graph coloring is non-deterministic in polynomial time and hard. To the best of our knowledge, there is no algorithm as yet that procures an exact solution of the chromatic number comprehensively for any and all graphs within the polynomial (P) time domain. Here, we present a novel heuristic, namely the ‘trailing path’, which returns an approximate solution of the chromatic number within P time, and with a better accuracy than most existing algorithms. The ‘trailing path’ algorithm is effectively a subtle combination of the search patterns of two existing heuristics (DSATUR and largest first) and operates along a trailing path of consecutively connected nodes (and thereby effectively maps to the problem of finding spanning tree(s) of the graph) during the entire course of coloring, where essentially lies both the novelty and the apt of the current approach. The study also suggests that the judicious implementation of randomness is one of the keys toward rendering an improved accuracy in such combinatorial optimization algorithms. Apart from the algorithmic attributes, essential properties of graph partitioning in random and different structured networks have also been surveyed, followed by a comparative study. The study reveals the remarkable stability and absorptive property of chromatic number across a wide array of graphs. Finally, a case study is presented to demonstrate the potential use of graph coloring in protein design—yet another hard problem in structural and evolutionary biology.

Keywords

Chromatic number Graph partitioning NP to P Motif identifier Protein design 

Notes

Acknowledgement

The work was supported by the Department of Science and Technology—Science and Engineering Research Board (DST-SERB research Grant PDF/2015/001079). We take the opportunity to thank Mr. Arnab Kar (Department of IT, IIIT Alahabad) for his brief participation during the revision.

Authors’ contributions

SB conceived the problem. AB and SB designed the algorithm. AB wrote the initial MATLAB code which was improved at different stages by both AB and SB. For the analysis, AB provided small scripts which were executed by SB to carry out the computational experiments. AB and SB analyzed the results. SB wrote the paper with help from AB. AKD participated in the comparison with other heuristics and provided crucial notes at different portions of the manuscript. All authors read and approved the final manuscript.

Compliance with ethical standards

Conflict of interest

None of the authors have any competing interests in the manuscript.

Supplementary material

500_2019_4278_MOESM1_ESM.pdf (2.3 mb)
Supplementary material 1 (PDF 2328 kb)

References

  1. Albert R, Barabási A-L (2002) Statistical mechanics of complex networks. Rev Mod Phys 74:47–97.  https://doi.org/10.1103/RevModPhys.74.47 MathSciNetCrossRefzbMATHGoogle Scholar
  2. Albertson MO, Cranston DW, Fox J (2010) Crossings, colorings, and cliques. ArXiv10063783 MathGoogle Scholar
  3. Andreev K, Räcke H (2004) Balanced graph partitioning. In: Proceedings of the sixteenth annual ACM symposium on parallelism in algorithms and architectures. ACM, New York, pp 120–124Google Scholar
  4. Appel K, Haken W (1977) Every planar map is four colorable. Part I: discharging. Ill J Math 21:429–490CrossRefzbMATHGoogle Scholar
  5. Arora S, Barak B (2009) Computational complexity: a modern approach, 1st edn. Cambridge University Press, New YorkCrossRefzbMATHGoogle Scholar
  6. Banerjee R, Sen M, Bhattacharya D, Saha P (2003) The jigsaw puzzle model: search for conformational specificity in protein interiors. J Mol Biol 333:211–226CrossRefGoogle Scholar
  7. Basu S, Bhattacharyya D, Banerjee R (2011) Mapping the distribution of packing topologies within protein interiors shows predominant preference for specific packing motifs. BMC Bioinform 12:195.  https://doi.org/10.1186/1471-2105-12-195 CrossRefGoogle Scholar
  8. Basu S, Bhattacharyya D, Banerjee R (2012) Self-complementarity within proteins: bridging the gap between binding and folding. Biophys J 102:2605–2614.  https://doi.org/10.1016/j.bpj.2012.04.029 CrossRefGoogle Scholar
  9. Basu S, Bhattacharyya D, Banerjee R (2014) Applications of complementarity plot in error detection and structure validation of proteins. Indian J Biochem Biophys 51:188–200Google Scholar
  10. Berhanu WM, Masunov AE (2012) Alternative packing modes leading to amyloid polymorphism in five fragments studied with molecular dynamics. Biopolymers 98:131–144.  https://doi.org/10.1002/bip.21731 CrossRefGoogle Scholar
  11. Berman HM, Westbrook J, Feng Z et al (2000) The protein data bank. Nucleic Acids Res 28:235–242.  https://doi.org/10.1093/nar/28.1.235 CrossRefGoogle Scholar
  12. Blum M, Metcalf P, Harrison SC, Wiley DC (1987) A system for collection and on-line integration of X-ray diffraction data from a multiwire area detector. J Appl Crystallogr 20:235–242.  https://doi.org/10.1107/S0021889887086783 CrossRefGoogle Scholar
  13. Bollobás B, Catlin PA, Erdös P (1980) Hadwiger’s conjecture is true for almost every graph. Eur J Comb 1:195–199.  https://doi.org/10.1016/S0195-6698(80)80001-1 MathSciNetCrossRefzbMATHGoogle Scholar
  14. Brélaz D (1979) New methods to color the vertices of a graph. Commun ACM 22:251–256.  https://doi.org/10.1145/359094.359101 MathSciNetCrossRefzbMATHGoogle Scholar
  15. Choromański K, Matuszak M, Miȩkisz J (2013) Scale-free graph with preferential attachment and evolving internal vertex structure. J Stat Phys 151:1175–1183.  https://doi.org/10.1007/s10955-013-0749-1 MathSciNetCrossRefzbMATHGoogle Scholar
  16. Clauset A, Shalizi CR, Newman MEJ (2009) Power-law distributions in empirical data. SIAM Rev 51:661–703.  https://doi.org/10.1137/070710111 MathSciNetCrossRefzbMATHGoogle Scholar
  17. Crick FHC, IUCr (1953) The packing of -helices: simple coiled-coils. In: Acta crystallogr. http://scripts.iucr.org/cgi-bin/paper?S0365110X53001964. Accessed 30 Nov 2016
  18. Dailey DP (1980) Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete. Discrete Math 30:289–293.  https://doi.org/10.1016/0012-365X(80)90236-8 MathSciNetCrossRefzbMATHGoogle Scholar
  19. Demange M, Monnot J, Pop P, Ries B (2014) On the complexity of the selective graph coloring problem in some special classes of graphs. Theor Comput Sci 540–541:89–102.  https://doi.org/10.1016/j.tcs.2013.04.018 MathSciNetCrossRefzbMATHGoogle Scholar
  20. Deng W, Chen R, Gao J et al (2012a) A novel parallel hybrid intelligence optimization algorithm for a function approximation problem. Comput Math Appl 63:325–336.  https://doi.org/10.1016/j.camwa.2011.11.028 MathSciNetCrossRefzbMATHGoogle Scholar
  21. Deng W, Chen R, He B et al (2012b) A novel two-stage hybrid swarm intelligence optimization algorithm and application. Soft Comput 16:1707–1722.  https://doi.org/10.1007/s00500-012-0855-z CrossRefGoogle Scholar
  22. Deng W, Yang X, Zou L et al (2013) An improved self-adaptive differential evolution algorithm and its application. Chemom Intell Lab Syst 128:66–76.  https://doi.org/10.1016/j.chemolab.2013.07.004 CrossRefGoogle Scholar
  23. Deng W, Zhao H, Liu J et al (2015) An improved CACO algorithm based on adaptive method and multi-variant strategies. Soft Comput 19:701–713.  https://doi.org/10.1007/s00500-014-1294-9 CrossRefGoogle Scholar
  24. Deng W, Yao R, Zhao H et al (2017a) A novel intelligent diagnosis method using optimal LS-SVM with improved PSO algorithm. Soft Comput.  https://doi.org/10.1007/s00500-017-2940-9 Google Scholar
  25. Deng W, Zhao H, Yang X et al (2017b) Study on an Improved adaptive PSO algorithm for solving multi-objective gate assignment. Appl Soft Comput 59:288–302.  https://doi.org/10.1016/j.asoc.2017.06.004 CrossRefGoogle Scholar
  26. Deng W, Zhao H, Zou L et al (2017c) A novel collaborative optimization algorithm in solving complex optimization problems. Soft Comput 21:4387–4398.  https://doi.org/10.1007/s00500-016-2071-8 CrossRefGoogle Scholar
  27. Deng W, Zhang S, Zhao H, Yang X (2018) A novel fault diagnosis method based on integrating empirical wavelet transform and fuzzy entropy for motor bearing. IEEE Access 6:35042–35056.  https://doi.org/10.1109/ACCESS.2018.2834540 CrossRefGoogle Scholar
  28. Deng W, Xu J, Zhao H (2019) An improved ant colony optimization algorithm based on hybrid strategies for scheduling problem. IEEE Access 7:20281–20292.  https://doi.org/10.1109/ACCESS.2019.2897580 CrossRefGoogle Scholar
  29. Díaz J, Petit J, Serna M (2002) A survey of graph layout problems. ACM Comput Surv 34:313–356.  https://doi.org/10.1145/568522.568523 CrossRefGoogle Scholar
  30. Dill KA, MacCallum JL (2012) The protein-folding problem, 50 years on. Science 338:1042–1046.  https://doi.org/10.1126/science.1219021 CrossRefGoogle Scholar
  31. Dong FM, Koh KM, Teo KL (2005) Chromatic polynomials and chromaticity of graphs. World Scientific, SingaporeCrossRefzbMATHGoogle Scholar
  32. Fidanova S, Pop P (2016) An improved hybrid ant-local search algorithm for the partition graph coloring problem. J Comput Appl Math 293:55–61.  https://doi.org/10.1016/j.cam.2015.04.030 MathSciNetCrossRefzbMATHGoogle Scholar
  33. Gallian JA (2015) Graph labeling. Electron J Comb 1000:DS6zbMATHGoogle Scholar
  34. Garey MR, Johnson DS, Stockmeyer L (1974) Some simplified NP-complete problems. In: Proceedings of the sixth annual ACM symposium on theory of computing. ACM, New York, pp 47–63Google Scholar
  35. Gerstein M, Tsai J, Levitt M (1995) The volume of atoms on the protein surface: calculated from simulation, using Voronoi polyhedra. J Mol Biol 249:955–966.  https://doi.org/10.1006/jmbi.1995.0351 CrossRefGoogle Scholar
  36. Hallórsson MM (1993) A still better performance guarantee for approximate graph coloring. Inf Process Lett 45:19–23.  https://doi.org/10.1016/0020-0190(93)90246-6 MathSciNetCrossRefGoogle Scholar
  37. Hansen J, Kubale M, Kuszner Ł, Nadolski A (2004) Distributed largest-first algorithm for graph coloring. In: Euro-Par 2004 parallel processing. Springer, Berlin, Heidelberg, pp 804–811Google Scholar
  38. Harary F (1969) Graph theory. Addison-Wesley Publishing Company, BostonCrossRefzbMATHGoogle Scholar
  39. Janczewski R (2001) T-coloring of graphs and its applications. Gdansk University of Technology, ETI Faculty, GdanskzbMATHGoogle Scholar
  40. Jensen TR, Toft B (2011) Graph coloring problems. Wiley, New YorkzbMATHGoogle Scholar
  41. Jiang X, Farid H, Pistor E, Farid RS (2000) A new approach to the design of uniquely folded thermally stable proteins. Protein Sci Publ Protein Soc 9:403–416CrossRefGoogle Scholar
  42. Karp RM (1972) Reducibility among combinatorial problems. In: Miller RE, Thatcher JW, Bohlinger JD (eds) Complexity of computer computations. Springer, New York, pp 85–103CrossRefGoogle Scholar
  43. Kempe AB (1879) On the geographical problem of the four colours. Am J Math 2:193–200.  https://doi.org/10.2307/2369235 MathSciNetCrossRefGoogle Scholar
  44. Kosowski A, Manuszewski K (2004) Classical coloring of graphs. In: Graph colorings, pp 2–19Google Scholar
  45. Lai H-J, Lin J, Montgomery B et al (2006) Conditional colorings of graphs. Discrete Math 306:1997–2004.  https://doi.org/10.1016/j.disc.2006.03.052 MathSciNetCrossRefzbMATHGoogle Scholar
  46. Lee B, Richards FM (1971) The interpretation of protein structures: estimation of static accessibility. J Mol Biol 55:379–400CrossRefGoogle Scholar
  47. Lewis RMR (2016) A guide to graph colouring: algorithms and applications. Springer, BerlinCrossRefzbMATHGoogle Scholar
  48. Lovasz L (2006) On the shannon capacity of a graph. IEEE Trans Inf Theor 25:1–7.  https://doi.org/10.1109/TIT.1979.1055985 MathSciNetCrossRefzbMATHGoogle Scholar
  49. MacDougall JA, Miller M, Wallis WD (2002) Vertex-magic total labelings of graphs. Util Math 61:3–21MathSciNetzbMATHGoogle Scholar
  50. Marx D (2003) Graph colouring problems and their applications in schedulingGoogle Scholar
  51. McDiarmid CJH, Sánchez-Arroyo A (1994) Total colouring regular bipartite graphs is NP-hard. Discrete Math 124:155–162.  https://doi.org/10.1016/0012-365X(92)00058-Y MathSciNetCrossRefzbMATHGoogle Scholar
  52. McIlvaine TC (1921) A buffer solution for colorimetric comparison. J Biol Chem 49:183–186Google Scholar
  53. Munson M, Balasubramanian S, Fleming KG et al (1996) What makes a protein a protein? Hydrophobic core designs that specify stability and structural properties. Protein Sci Publ Protein Soc 5:1584–1593CrossRefGoogle Scholar
  54. Newman MEJ (2006) Modularity and community structure in networks. Proc Natl Acad Sci USA 103:8577–8582.  https://doi.org/10.1073/pnas.0601602103 CrossRefGoogle Scholar
  55. Peng Z, Oldfield CJ, Xue B et al (2014) A creature with a hundred waggly tails: intrinsically disordered proteins in the ribosome. Cell Mol Life Sci 71:1477–1504.  https://doi.org/10.1007/s00018-013-1446-6 CrossRefGoogle Scholar
  56. Pirun M, Babnigg G, Stevens FJ (2005) Template-based recognition of protein fold within the midnight and twilight zones of protein sequence similarity. J Mol Recognit JMR 18:203–212.  https://doi.org/10.1002/jmr.728 CrossRefGoogle Scholar
  57. RJLipton + KWRegan (2015) A big result on graph isomorphism. In: Gödels Lost Lett. PNP. https://rjlipton.wordpress.com/2015/11/04/a-big-result-on-graph-isomorphism/. Accessed 30 Nov 2016
  58. Rost B (1999) Twilight zone of protein sequence alignments. Protein Eng 12:85–94CrossRefGoogle Scholar
  59. Roy S, Basu S, Dasgupta D et al (2015) The unfolding MD simulations of cyclophilin: analyzed by surface contact networks and their associated metrics. PLOS ONE 10:e0142173.  https://doi.org/10.1371/journal.pone.0142173 CrossRefGoogle Scholar
  60. San Segundo P (2012) A new DSATUR-based algorithm for exact vertex coloring. Comput Oper Res 39:1724–1733.  https://doi.org/10.1016/j.cor.2011.10.008 MathSciNetCrossRefzbMATHGoogle Scholar
  61. Sanders DP, Zhao Y (2001) On improving the edge-face coloring theorem. Graphs Comb 17:329–341.  https://doi.org/10.1007/pl00007248 MathSciNetCrossRefzbMATHGoogle Scholar
  62. Stiebitz M, Škrekovski R (2006) A map colour theorem for the union of graphs. J Comb Theory Ser B 96:20–37.  https://doi.org/10.1016/j.jctb.2005.06.003 MathSciNetCrossRefzbMATHGoogle Scholar
  63. Street AG, Mayo SL (1999) Computational protein design. Structure 7:R105–R109.  https://doi.org/10.1016/S0969-2126(99)80062-8 CrossRefGoogle Scholar
  64. Tsai J, Taylor R, Chothia C, Gerstein M (1999) The packing density in proteins: standard radii and volumes1. J Mol Biol 290:253–266.  https://doi.org/10.1006/jmbi.1999.2829 CrossRefGoogle Scholar
  65. Wallis WD, Baskoro ET, Miller M, Slamin (2000) Edge-magic total labelings. Aust J Comb 22:177–190MathSciNetzbMATHGoogle Scholar
  66. Watts DJ, Strogatz SH (1998) Collective dynamics of “small-world” networks. Nature 393:440–442.  https://doi.org/10.1038/30918 CrossRefzbMATHGoogle Scholar
  67. Welsh DJA, Powell MB (1967) An upper bound for the chromatic number of a graph and its application to timetabling problems. Comput J 10:85–86.  https://doi.org/10.1093/comjnl/10.1.85 CrossRefzbMATHGoogle Scholar
  68. Zarrazola E, Gomez D, Montero J et al (2011) Network clustering by graph coloring: an application to astronomical images. In: 2011 11th international conference on intelligent systems design and applications (ISDA), pp 796–801Google Scholar
  69. Zhang P (2015) Color-Induced graph colorings. Springer, BerlinCrossRefzbMATHGoogle Scholar
  70. Zhao H, Li D, Deng W, Yang X (2017a) Research on vibration suppression method of alternating current motor based on fractional order control strategy. Proc Inst Mech Eng Part E J Process Mech Eng 231:786–799.  https://doi.org/10.1177/0954408916637380 CrossRefGoogle Scholar
  71. Zhao H, Sun M, Deng W, Yang X (2017b) A new feature extraction method based on EEMD and multi-scale fuzzy entropy for motor bearing. Entropy 19:14.  https://doi.org/10.3390/e19010014 CrossRefGoogle Scholar
  72. Zhao H, Yao R, Xu L et al (2018) Study on a novel fault damage degree identification method using high-order differential mathematical morphology gradient spectrum entropy. Entropy 20:682.  https://doi.org/10.3390/e20090682 CrossRefGoogle Scholar
  73. Zhu H, Sepulveda E, Hartmann MD et al (2016) Origin of a folded repeat protein from an intrinsically disordered ancestor. eLife.  https://doi.org/10.7554/elife.16761 Google Scholar

Copyright information

© Springer-Verlag GmbH Germany, part of Springer Nature 2019

Authors and Affiliations

  1. 1.Department of MathematicsNational Institute of Technology, DurgapurDurgapurIndia
  2. 2.Department of ITIIIT AlahabadJhalwa, AlahabadIndia
  3. 3.Department of EECSIIT BhilaiRaypurIndia
  4. 4.Department of Physics and AstronomyClemson UniversityClemsonUSA
  5. 5.3BIO, ULBBrusselsBelgium
  6. 6.Department of MicrobiologyAsutosh CollegeKolkataIndia

Personalised recommendations