Skip to main content
SpringerLink
Log in

Linear-Time Recognition of Circular-Arc Graphs

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

A graph G is a circular-arc graph if it is the intersection graph of a set of arcs on a circle. That is, there is one arc for each vertex of G, and two vertices are adjacent in G if and only if the corresponding arcs intersect. We give a linear-time algorithm for recognizing this class of graphs. When G is a member of the class, the algorithm gives a certificate in the form of a set of arcs that realize it.

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.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Department of Computer Science, Colorado State University, Fort Collins, CO 80523-1873, USA

    Ross M. McConnell

Authors
  1. Ross M. McConnell
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ross M. McConnell.

Rights and permissions

Reprints and permissions

About this article

Cite this article

McConnell, R. Linear-Time Recognition of Circular-Arc Graphs. Algorithmica 37, 93–147 (2003). https://doi.org/10.1007/s00453-003-1032-7

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-003-1032-7

Search

Navigation