Linear-Time Recognition of Circular-Arc Graphs | Zendy

Ross M. McConnell | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Linear-Time Recognition of Circular-Arc Graphs

Author(s) -

Ross M. McConnell

Publication year - 2003

Publication title -

algorithmica

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.647

H-Index - 78

eISSN - 1432-0541

pISSN - 0178-4617

ISBN - 0-7695-1390-5

DOI - 10.1007/s00453-003-1032-7

Subject(s) - combinatorics , mathematics , split graph , arc (geometry) , vertex (graph theory) , discrete mathematics , circle graph , theory of computation , intersection graph , graph , chordal graph , interval graph , 1 planar graph , line graph , pathwidth , algorithm , geometry

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 the corresponding arcs intersect. We give a linear time bound 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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research