Skip to main content
SpringerLink
Log in

Pre-processing and Linear-Decomposition Algorithm to Solve the k-Colorability Problem

  • Conference paper
Experimental and Efficient Algorithms (WEA 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3059))

Included in the following conference series:

Abstract

We are interested in the graph coloring problem. We studied the effectiveness of some pre-processings that are specific to the k-colorability problem and that promise to reduce the size or the difficulty of the instances. We propose to apply on the reduced graph an exact method based on a linear-decomposition of the graph. We present some experiments performed on literature instances, among which DIMACS library instances.

With the support of Conseil Régional de Picardie and FSE.

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 39.99
Price excludes VAT (USA)
  • Available as 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bodlaender, H.L.: A tourist guide through treewidth. Acta Cybernetica 11, 1–21 (1993)

    MATH  MathSciNet  Google Scholar 

  2. Brelaz, D.: New methods to color the vertices of a graph. Communications of the ACM 22(4), 251–256 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  3. Caramia, M., Dell’Olmo, P.: Vertex coloring by multistage branch-and-bound. In: Computational Symposium on Graph Coloring and its Generalizations, Corneil University (September 2002)

    Google Scholar 

  4. Carlier, J., Lucet, C.: A decomposition algorithm for network reliability evaluation. Discrete Appl. Math. 65, 141–156 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  5. de Werra, D.: An introduction to timetabling. European Journal of Operation Research 19, 151–162 (1985)

    Article  MATH  Google Scholar 

  6. de Werra, D.: On a multiconstrained model for chromatic scheduling. Discrete Appl. Math. 94, 171–180 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  7. Diaz, M., Zabala, P.: A branch-and-cut algorithm for graph coloring. In: Computational Symposium on Graph Coloring and its Generalizations, Corneil University (September 2002)

    Google Scholar 

  8. Funabiki, N., Higashino, T.: A minimal-state processing search algorithm for graph coloring problems. IEICE Transactions on Fundamentals E83-A(7), 1420–1430 (2000)

    Google Scholar 

  9. Galinier, P., Hao, J.K.: Hybrid evolutionary algorithms for graph coloring. Journal of Combinatorial Optimization 3(4), 379–397 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  10. Garey, M.R., Johnson, D.S.: Computers and Intractability – A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)

    MATH  Google Scholar 

  11. Glover, F., Parker, M., Ryan, J.: Coloring by tabu branch and bound. In: Trick and Johnson [23], pp. 285–308

    Google Scholar 

  12. Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York (1980)

    MATH  Google Scholar 

  13. Hertz, A., De Werra, D.: Using tabu search techniques for graph coloring. Computing 39, 345–351 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  14. Kubale, M., Jackowski, B.: A generalized implicit enumeration algorithm for graph coloring. Communications of the ACM 28(4), 412–418 (1985)

    Article  Google Scholar 

  15. Lucet, C.: Méthode de décomposition pour l’évaluation de la fiabilité des réseaux. PhD thesis, Université de Technologie de Compiègne (1993)

    Google Scholar 

  16. Manouvrier, J.F.: Méthode de décomposition pour résoudre des problèmes combinatoires sur les graphes. PhD thesis, Université de Technologie de Compiègne (1998)

    Google Scholar 

  17. Manvel, B.: Extremely greedy coloring algorithms. In: Harary, F., Maybee, J.S. (eds.) Graphs and applications: Proceedings of the First Colorado Symposium on Graph Theory, New York, pp. 257–270. John Wiley & Sons, Chichester (1985)

    Google Scholar 

  18. Mehrotra, A., Trick, M.A.: A column generation approach for graph coloring. INFORMS Journal on Computing 8(4), 344–354 (1996)

    Article  MATH  Google Scholar 

  19. Morgenstern, C.A.: Distributed coloration neighborhood search. In: Trick and Johnson [23], pp. 335–357

    Google Scholar 

  20. Sager, T.J., Lin, S.: A pruning procedure for exact graph coloring. ORSA Journal on Computing 3, 226–230 (1991)

    MATH  Google Scholar 

  21. Sen Sarma, S., Bandyopadhyay, S.K.: Some sequential graph colouring algorithms. International Journal of Electronic 67(2), 187–199 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  22. Sewell, E.: An improved algorithm for exact graph coloring. In: Trick and Johnson [23], pp. 359–373

    Google Scholar 

  23. Trick, M.A., Johnson, D.S. (eds.) Cliques, Coloring, and Satisfiability: Proceedings of the Second DIMACS Implementation Challenge, American Mathematical Society, Providence

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LaRIA EA 2083, 5 rue du Moulin Neuf, 80000, Amiens, France

    Corinne Lucet & Florence Mendes

  2. HeuDiaSyC UMR CNRS 6599 UTC, BP 20529, 60205, Compiègne, France

    Aziz Moukrim

Authors
  1. Corinne Lucet
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Florence Mendes
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Aziz Moukrim
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Universidade Federal Fluminense, Rua Passo da Pátria, 156, Bloco E, RJ 24210-240, Niterói, Brazil

    Celso C. Ribeiro

  2. Departamento de Ciência da Computação, Universidade Federal Fluminense, Niterói, RJ, Brazil

    Simone L. Martins

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lucet, C., Mendes, F., Moukrim, A. (2004). Pre-processing and Linear-Decomposition Algorithm to Solve the k-Colorability Problem. In: Ribeiro, C.C., Martins, S.L. (eds) Experimental and Efficient Algorithms. WEA 2004. Lecture Notes in Computer Science, vol 3059. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24838-5_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24838-5_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22067-1

  • Online ISBN: 978-3-540-24838-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation