Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Graph-Theoretic Concepts in Computer Science

WG 2008: Graph-Theoretic Concepts in Computer Science pp 324–335Cite as

From a Circular-Arc Model to a Proper Circular-Arc Model

  • Conference paper

  • 712 Accesses

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

Abstract

We are given a circular-arc graph, represented by a circular-arc model; our goal is to decide whether the graph is a proper circular-arc graph. We do so in time linear in the number of vertices of the graph, regardless of the number of edges which may be quadratic in the number of vertices. For every input graph, we either provide a proper circular-arc model for the graph, or a forbidden subgraph induced in the graph.

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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Deng, X., Hell, P., Huang, J.: Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs. SIAM J. Comput. 25, 390–403 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  2. Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs, 2nd edn. Annals of Discrete Mathematics, vol. 57. Elsevier, Amsterdam (2004)

    MATH  Google Scholar 

  3. Golumbic, M.C., Hammer, P.L.: Stability in Circular Arc Graphs. J. Algorithms 9, 314–320 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  4. Hsu, W.L.: O(mn) Algorithms for the Recognition and Isomorphism Problems on Circular-Arc Graphs. SIAM J. Comput. 24, 411–439 (1995)

    Article  MATH  Google Scholar 

  5. Hsu, W.L., Tsai, K.H.: Linear Time Algorithms on Circular-Arc Graphs. Info. Proc. Lett. 40, 123–129 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  6. Joeris, B.L., Lin, M.C., McConnell, R.M., Spinrad, J.P., Szwarcfiter, J.L.: Linear Time Recognition of Helly Circular-Arc Models and Graphs (submitted)

    Google Scholar 

  7. Kaplan, H., Nussbaum, Y.: Certifying Algorithms for Recognizing Proper Circular-Arc Graphs and Unit Circular-Arc Graphs. In: Fomin, F.V. (ed.) WG 2006. LNCS, vol. 4271, pp. 289–300. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  8. Kaplan, H., Nussbaum, Y.: A Simpler Linear-Time Recognition of Circular-Arc Graphs. In: Arge, L., Freivalds, R. (eds.) SWAT 2006. LNCS, vol. 4059, pp. 41–52. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  9. Lin, M.C., Szwarcfiter, J.L.: Efficient Construction of Unit Circular-Arc Models. In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, pp. 309–315. ACM Press, New York (2006)

    Chapter  Google Scholar 

  10. Lin, M.C., Soulignac, F.J., Szwarcfiter, J.L.: Proper Helly Circular-Arc Graphs. In: Brandstädt, A., Kratsch, D., Müller, H. (eds.) WG 2007. LNCS, vol. 4769, pp. 248–257. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  11. Manacher, G.K., Mankus, T.A.: A Simple Linear Time Algorithm for Finding a Maximum Independent Set of Circular Arcs Using Intervals Alone. Networks 39, 68–72 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  12. Masuda, S., Nakajima, K.: An Optimal Algorithm for Finding a Maximum Independent Set of a Circular-Arc Graph. SIAM J. Comput. 17, 41–52 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  13. McConnell, R.M.: Linear-Time Recognition of Circular-Arc Graphs. Algorithmica 37, 93–147 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  14. Roberts, F.S.: Indifference Graphs. In: Harary, F. (ed.) Proof Techniques in Graph Theory: Proceedings of the Second Ann Arbor Conference, pp. 139–146. Academic Press, London (1969)

    Google Scholar 

  15. Shih, W.K., Hsu, W.L.: An O(n 1.5) Algorithm to Color Proper Circular Arcs. Discrete Applied Mathematics 25, 321–323 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  16. Spinrad, J.P.: Efficient Graph Representations. In: Fields Institute Monographs, vol. 19. American Mathematical Society, Providence (2003)

    Google Scholar 

  17. Tucker, A.: Structure Theorems for Some Classes of Circular-Arc Graphs. Discrete Mathematics 7, 167–195 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  18. Tucker, A.: An Efficient Test for Circular-Arc Graphs. SIAM J. Comput. 9, 1–24 (1980)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, Tel Aviv University, 69978, Tel Aviv, Israel

    Yahav Nussbaum

Authors
  1. Yahav Nussbaum
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Durham University, South Road, DH1 3LE, Durham, UK

    Hajo Broersma , Tom Friedetzky  & Daniel Paulusma ,  & 

  2. Department of Computer Science, University of Leicester, University Road, LE1 7RH, Leicester, UK

    Thomas Erlebach

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nussbaum, Y. (2008). From a Circular-Arc Model to a Proper Circular-Arc Model. In: Broersma, H., Erlebach, T., Friedetzky, T., Paulusma, D. (eds) Graph-Theoretic Concepts in Computer Science. WG 2008. Lecture Notes in Computer Science, vol 5344. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92248-3_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-92248-3_29

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-92247-6

  • Online ISBN: 978-3-540-92248-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation