Skip to main content
SpringerLink
Log in

A Tree-Based Graph Coloring Algorithm Using Independent Set

  • Conference paper
  • First Online:
Progress in Advanced Computing and Intelligent Engineering

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 714))

Abstract

This paper introduces a tree data structure-based graph coloring algorithm. Algorithm explores vertices in the tree form to finds maximal independent set, than these independent sets are colored with minimum colors. Proposed algorithm is tested on various DIMACS standard of graph instances. Algorithm is design to solve graph coloring problem for high degree graphs, i.e. the proposed algorithm is highly efficient for those graphs which has number of edges to number of vertices ratio is very high. Worst and best case time complexity of proposed algorithm is also discussed in this paper.

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

Access this chapter

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 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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

Institutional subscriptions

Similar content being viewed by others

References

  1. Berchtold, S., Böhm, C., Braunmüller, B., Keim, D. A., and Kriegel, H.-P.: Fast Parallel Similarity Search in Multimedia Databases, In ACM SIGMOD Int. Conf. on Management of Data, (1997)

    Google Scholar 

  2. Chaitin, G. J., Auslander, M. A., Chandra, A. K., Cocke, J., Hopkins, M. E., and Markstein, P. W.: Register Allocation via Coloring. Computer Languages, Vol. 6, Issue 1, (1981) 47–57

    Google Scholar 

  3. Mahmoudi, S., Lotfi, S.: Modified cuckoo optimization algorithm (MCOA) to solve graph coloring problem. ELSVIER, Applied Soft Computing, (2015) 48–64

    Google Scholar 

  4. Gupta A., Patidar H.: A Survey on Heuristic Graph Coloring Algorithm. International Journal for Scientific Research & Development, Vol. 4, Issue 04, (2016) 297–301

    Google Scholar 

  5. Salari, E., and Eshghi, K.: An ACO Algorithm for the Graph Coloring Problem. Interracial Journal Contemp. Math Sciences, Vol. 3, no. 6 (2008) 293–304

    Google Scholar 

  6. Thang, N. Bui, Nguyen, T. H., Patel, C. M., and Kim-Anh Phan, T.: An Ant-Based Algorithm for Coloring Graphs. Discrete Applied Mathematics 156 (2008) 190–200

    Google Scholar 

  7. Chen, B., Chen, Bo., Liu, H., Zhang X.: A Fast Parallel Genetic Algorithm for Graph Coloring Problem Based on CUDA. IEEE International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery, (2015) 145–148

    Google Scholar 

  8. Sabar, N. R., Ayob M., Qu, R., Kendall, G.: A Graph Coloring Constructive Hyper-Heuristic for Examination Time Tabling Problems. Online publication, Springer Science Business Media, (2011)

    Google Scholar 

  9. Hindi, M., and Yampolskiy, R. V.: Genetic Algorithm Applied to the Graph Coloring Problem, Proc. 23rd Midwest Artificial Intelligence and Cognitive Science Conf, (2012) 61–66

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Sir Padampat Singhania University, Udaipur, India

    Harish Patidar & Prasun Chakrabarti

Authors
  1. Harish Patidar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Prasun Chakrabarti
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Harish Patidar .

Editor information

Editors and Affiliations

  1. Department of Computer Science, Rama Devi Women’s University, Bhubaneswar, Odisha, India

    Chhabi Rani Panigrahi

  2. Department of Computer Science, Central University of Rajasthan, Ajmer, Rajasthan, India

    Arun K. Pujari

  3. Department of Computer Science and Engineering, Indian Institute of Technology Kharagpur, Kharagpur, India

    Sudip Misra

  4. Department of Computer Science, Rama Devi Women’s University, Bhubaneswar, Odisha, India

    Bibudhendu Pati

  5. Department of Computer Science and Information Engineering (CSIE), Providence University, Taichung, Taiwan

    Kuan-Ching Li

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Patidar, H., Chakrabarti, P. (2019). A Tree-Based Graph Coloring Algorithm Using Independent Set. In: Panigrahi, C., Pujari, A., Misra, S., Pati, B., Li, KC. (eds) Progress in Advanced Computing and Intelligent Engineering. Advances in Intelligent Systems and Computing, vol 714. Springer, Singapore. https://doi.org/10.1007/978-981-13-0224-4_48

Download citation

  • DOI: https://doi.org/10.1007/978-981-13-0224-4_48

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-13-0223-7

  • Online ISBN: 978-981-13-0224-4

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation