Skip to main content
SpringerLink
Log in

Treewidth of circular-arc graphs+

  • Conference paper
  • First Online:
Algorithms and Data Structures (WADS 1991)

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

Included in the following conference series:

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

Access this chapter

Log in via an institution

Institutional subscriptions

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Indian Institute of Technology, 600 036, Madras, India

    Ravi Sundaram, Karan Sher Singh & C. Pandu Rangan

Authors
  1. Ravi Sundaram
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Karan Sher Singh
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. C. Pandu Rangan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Frank Dehne Jörg-Rüdiger Sack Nicola Santoro

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sundaram, R., Singh, K.S., Rangan, C.P. (1991). Treewidth of circular-arc graphs+. In: Dehne, F., Sack, JR., Santoro, N. (eds) Algorithms and Data Structures. WADS 1991. Lecture Notes in Computer Science, vol 519. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028248

Download citation

  • DOI: https://doi.org/10.1007/BFb0028248

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54343-5

  • Online ISBN: 978-3-540-47566-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation