Extending Partial Representations of Circular-Arc Graphs

08/30/2021
by   Jiří Fiala, et al.
0

The partial representation extension problem generalizes the recognition problem for classes of graphs defined in terms of vertex representations. We exhibit circular-arc graphs as the first example of a graph class where the recognition is polynomially solvable while the representation extension problem is NP-complete. In this setting, several arcs are predrawn and we ask whether this partial representation can be completed. We complement this hardness argument with tractability results of the representation extension problem on various subclasses of circular-arc graphs, most notably on all variants of Helly circular-arc graphs. In particular, we give linear-time algorithms for extending normal proper Helly and proper Helly representations. For normal Helly circular-arc representations we give an O(n^3)-time algorithm. Surprisingly, for Helly representations, the complexity hinges on the seemingly irrelevant detail of whether the predrawn arcs have distinct or non-distinct endpoints: In the former case the previous algorithm can be extended, whereas the latter case turns out to be NP-complete. We also prove that representation extension problem of unit circular-arc graphs is NP-complete.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/09/2018

A note on simultaneous representation problem for interval and circular-arc graphs

In this short note, we show two NP-completeness results regarding the si...
research
09/27/2022

Partial and Simultaneous Transitive Orientations via Modular Decomposition

A natural generalization of the recognition problem for a geometric grap...
research
11/23/2020

Recognizing Proper Tree-Graphs

We investigate the parameterized complexity of the recognition problem f...
research
02/03/2021

Extending Partial Representations of Rectangular Duals with Given Contact Orientations

A rectangular dual of a graph G is a contact representation of G by axis...
research
02/02/2022

Modification Problems toward Proper (Helly) Circular-arc Graphs

We present a 9^k· n^O(1)-time algorithm for the proper circular-arc vert...
research
04/09/2019

Testing isomorphism of circular-arc graphs -- Hsu's approach revisited

Circular-arc graphs are intersection graphs of arcs on the circle. The a...
research
06/02/2019

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

In 1969, Alan Tucker characterized proper circular-arc graphs as those g...

Please sign up or login with your details

Forgot password? Click here to reset