Skip to main content
SpringerLink
Log in

Perfect Circular Arc Coloring

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

The circular arc coloring problem is to find a minimum coloring of a set of arcs of a circle so that no two overlapping arcs share a color. This NP-hard problem arises in a rich variety of applications and has been studied extensively. In this paper we present an O(n2 m) combinatorial algorithm for optimally coloring any set of arcs that corresponds to a perfect graph, and propose a new approach to the general circular arc coloring problem.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • R.P. Anstee and M. Farber, “Characterizations of totally balanced matrices,” J. Algorithms, vol. 5, pp. 215–230, 1984.

    Google Scholar 

  • B.K. Bhattacharya and D. Kaller, “An O(m + n log n) algorithm for the maximum-clique problem in circular-arc graphs,” J. Algorithms, vol. 25, pp. 336–358, 1997.

    Google Scholar 

  • M.-S. Chang, “Algorithms for maximum matching and minimum fill-in on chordal bipartite graphs,” in Lecture Notes in Comput. Sci., vol. 1178, Springer, Berlin, 1996, pp. 146–155.

  • C.T. Cheng, “Improved approximation algorithms for the demand routing and slotting problem with unit demands on rings,” SIAM J. Discrete Math., vol. 17, pp. 384–402, 2004.

    Google Scholar 

  • M. Chudnovsky, N. Robertson, P.D. Seymour, and R. Thomas, “The strong perfect graph theorem,” Ann. of Math. (to appear).

  • F.F. Dragan, “On greedy matching ordering and greedy matchable graphs,” in Lecture Notes in Comput. Sci., vol. 1335, Springer, Berlin, 1997, pp. 184–198,

  • F.F. Dragan, “Strongly orderable graphs: A common generalization of strongly chordal and chordal bipartite graphs,” Discrete Appl. Math., vol. 99, pp. 427–442, 2000.

    Google Scholar 

  • M. Farber, “Characterizations of strongly chordal graphs,” Discrete Math., vol. 43, pp. 173–189, 1983.

    Google Scholar 

  • M.R. Garey, D.S. Johnson, G.L. Miller, and C.H. Papadimitriou, “The complexity of coloring circular arcs and chords,” SIAM J. Alg. Disc. Meth., vol. 1, pp. 217–227, 1980.

    Google Scholar 

  • M. Grötschel, L. Lovász, and A. Schrijver, “The ellipsoid method and its consequences in combinatorial optimization,” Combinatorica, vol. 1, pp. 169–197, 1981.

    Google Scholar 

  • M. Grötschel, L. Lovász, and A. Schrijver, “Polynomial algorithms for perfect graphs,” Ann. Discrete Math., vol. 21, pp. 325–356, 1984.

    Google Scholar 

  • W.-L. Hsu, “How to color claw-free prefect graphs,” Ann. Discrete Math., vol. 11, pp. 189–197, 1981.

    Google Scholar 

  • I.A. Karapetian, “Coloring of arc graphs,” Akad. Nauk Armyan. SSR Dokl., vol. 70, pp. 306–311, 1980.

    Google Scholar 

  • V. Kumar, “An approximation algorithm for circular arc coloring,” Algorithmica, vol. 30, pp. 406–417, 2001.

    Google Scholar 

  • A. Lubiw, “Doubly lexical orderings of matrices,” SIAM J. Comput., vol. 16, pp. 854–879, 1987.

    Google Scholar 

  • T. Niessen and J. Kind, “The round-up property of the fractional chromatic number for proper circular arc graphs,” J. Graph Theory, vol. 33, pp. 256–267, 2000.

    Google Scholar 

  • J.B. Orlin, M.A. Bonuccelli, and D.P. Bovet, “An O(n2) algorithm for coloring proper circular arc graphs,” SIAM J. Alg. Disc. Meth., vol. 2, pp. 88–93, 1981.

    Google Scholar 

  • W.-K. Shih and W.-L. Hsu, “An O(n1.5) algorithm to color proper circular arcs,” Discrete Appl. Math., vol. 25, pp. 321–323, 1989.

    Google Scholar 

  • W.-K. Shih and W.-L. Hsu, “An O(n log n+m log log n) maximum weight clique algorithm for circular-arc graphs,” Inform. Process. Lett., vol. 31, pp. 129–134, 1989.

    Google Scholar 

  • W.-K. Shih and W.-L. Hsu, “An approximation algorithm for coloring circular-arc graphs,” SIAM Conference on Discrete Mathematics, San Francisco, 1990.

  • A. Teng and A. Tucker, “An O(qn) algorithm to q-Color a proper family of circular arcs,” Discrete Math., vol. 25, pp. 233–243, 1985.

    Google Scholar 

  • A. Tucker, “Coloring a family of circular arcs,” SIAM J. Appl. Math., vol. 29, pp. 493–502, 1975.

    Google Scholar 

  • M. Valencia-Pabon, “Revisiting Tucker’s algorithm to color circular arc graphs,” SIAM J. Comput., vol. 32, pp. 1067–1072, 2003.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Applied Mathematics, Academia Sinica, Beijing, 100080, China

    Xujin Chen

  2. Department of Mathematics, Central China Normal University, Wuhan, 430079, China

    Zhiquan Hu

  3. Department of Mathematics, University of Hong Kong, Hong Kong, China

    Wenan Zang

Authors
  1. Xujin Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhiquan Hu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Wenan Zang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Wenan Zang.

Additional information

Partially supported by Project 02139 of Education Ministry of China.

Supported in part by the Research Grants Council of Hong Kong (Project No. HKU7054/03P) and a seed funding for basic research of HKU.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chen, X., Hu, Z. & Zang, W. Perfect Circular Arc Coloring. J Comb Optim 9, 267–280 (2005). https://doi.org/10.1007/s10878-005-1411-x

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-005-1411-x

Keywords

Search

Navigation