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

No abstract is available for this paper.

• Publication year

  2008

• Venue

  International Workshop on Graph-Theoretic Concepts in Computer Science

• Publication date

  2008-12-05

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/978-3-540-92248-3_29
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Linear-Time Recognition of Helly Circular-Arc Models and Graphs

  2011cited by this paper
• Proper Helly Circular-Arc Graphs

  2007cited by this paper
• Algorithm Theory - SWAT 2006, 10th ScandinavianWorkshop on Algorithm Theory, Riga, Latvia, July 6-8, 2006, Proceedings

  2006cited by this paper
• A Simpler Linear-Time Recognition of Circular-Arc Graphs

  2006cited by this paper
• Efficient construction of unit circular-arc models

  2006cited by this paper
• Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs

  2006cited by this paper
• Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

  2004cited by this paper
• Efficient graph representations

  2003cited by this paper
• A simple linear time algorithm for finding a maximum independent set of circular arcs using intervals alone

  2002cited by this paper
• Linear-Time Recognition of Circular-Arc Graphs

  2001cited by this paper
• Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs

  1996cited by this paper
• O(M*N) Algorithms for the Recognition and Isomorphism Problems on Circular-Arc Graphs

  1995influential reference
• Linear Time Algorithms on Circular-Arc Graphs

  1991influential reference
• Difference graphs

  1990cited by this paper
• An O(n1.5) algorithm to color proper circular arcs

  1989cited by this paper
• Stability in Circular Arc Graphs

  1988influential reference
• An Optimal Algorithm for Finding a Maximum Independent Set of a Circular-Arc Graph

  1988cited by this paper
• An Efficient Test for Circular-Arc Graphs

  1980cited by this paper
• Algorithmic graph theory and perfect graphs

  1980cited by this paper
• Structure theorems for some circular-arc graphs

  1974cited by this paper

• Circularly compatible ones, D-circularity, and proper circular-arc bigraphs

  2019cites this paper
• Essential obstacles to Helly circular-arc graphs

  2016cites this paper
• Normal Helly circular-arc graphs and its subclasses

  2013cites this paper
• Isomorphism of graph classes related to the circular-ones property

  2012cites this paper
• Subclasses of Normal Helly Circular-Arc Graphs

  2011cites this paper