Extending partial representations of circle graphs

@article{Chaplick2013ExtendingPR,
  title={Extending partial representations of circle graphs},
  author={Steven Chaplick and Radoslav Fulek and Pavel Klav{\'i}k},
  journal={Journal of Graph Theory},
  year={2013},
  volume={91},
  pages={365 - 394}
}
The partial representation extension problem is a recently introduced generalization of the recognition problem. A circle graph is an intersection graph of chords of a circle. We study the partial representation extension problem for circle graphs, where the input consists of a graph G and a partial representation R′ giving some predrawn chords that represent an induced subgraph of G . The question is whether one can extend R ′ to a representation R of the entire graph G , that is, whether one… 

Extending Partial Representations of Circle Graphs in Near-Linear Time

The partial representation extension problem generalizes the recognition problem for geometric intersection graphs. The input consists of a graph G , a subgraph H ⊆ G and a representation H of H .

Extending Partial Representations of Circular-Arc Graphs

It is proved that representation extension problem of unit circular-arc graphs is NP-complete and linear-time algorithms for extending normal proper Helly and proper HellY representations are given.

Partial and Simultaneous Transitive Orientations via Modular Decomposition

A natural generalization of the recognition problem for a geometric graph class is the problem of extending a representation of a subgraph to a representation of the whole graph. A related problem is

Linear-time Algorithm for Partial Representation Extension of Interval Graphs

A linear-time algorithm based on PQ-trees which solves the problem of recognizing interval graphs by solving whether it is possible to place the remaining interval and create an interval representation R of the entire graph G extending R'.

Minimal Obstructions for Partial Representations of Interval Graphs

The minimal obstructions which make partial representations non-extendible of interval graphs are characterized and this characterization leads to a linear-time certifying algorithm for partial representation extension.

Extending Partial Representations of Proper and Unit Interval Graphs

It is shown that this problem of bounded representations of unit interval graphs, where the input constrains the positions of some intervals by lower and upper bounds, is NP-complete for disconnected input graphs and a linear-time algorithm for extending proper interval representations is given.

Extension Properties of Graphs and Structures

The main idea of this thesis is to ask what extra information can be deduced from the structure of all possible geometric representations of graphs, namely their automorphism groups, the graph isomorphism problem and regular graph covering.

Contact Representations of Planar Graphs: Extending a Partial Representation is Hard

These are the first classes of geometric graphs where extending partial representations is provably harder than recognition, as opposed to e.g. interval graphs, circle graphs, permutation graphs or even standard representations of plane graphs.

Extending Partial Representations of Trapezoid Graphs

The complexity of partial representation extension for one of the two major remaining classes of geometric intersection graphs for which it has been unknown (circular-arc graphs being the other) is determined.

Title : Algorithmic aspects of intersection-defined graph classes

Geometrically representable graphs are extensively studied area of research in contemporary literature due to their structural characterizations and efficient algorithms. The most frequently studied

References

SHOWING 1-10 OF 35 REFERENCES

Linear-time Algorithm for Partial Representation Extension of Interval Graphs

A linear-time algorithm based on PQ-trees which solves the problem of recognizing interval graphs by solving whether it is possible to place the remaining interval and create an interval representation R of the entire graph G extending R'.

Minimal Obstructions for Partial Representations of Interval Graphs

The minimal obstructions which make partial representations non-extendible of interval graphs are characterized and this characterization leads to a linear-time certifying algorithm for partial representation extension.

Contact Representations of Planar Graphs: Extending a Partial Representation is Hard

These are the first classes of geometric graphs where extending partial representations is provably harder than recognition, as opposed to e.g. interval graphs, circle graphs, permutation graphs or even standard representations of plane graphs.

Extending Partial Representations of Function Graphs and Permutation Graphs

A polynomial-time algorithm for extending a partial representation of a graph by functions defined on the entire interval [0,1] provided for some of the vertices is presented.

Practical and Efficient Circle Graph Recognition

The algorithm is an extension of a Split Decomposition algorithm with the same running time developed by the authors in a companion paper, based on a new incremental Lexicographic Breadth-First Search characterization of circle graphs, and a new efficient data-structure for circle graphs.

The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs

The results can be extended to solve a generalized version of the simultaneous representation problem when there are k graphs any two of which share a common vertex set X, equivalent to the graph sandwich problem when the set of optional edges induce a k -partite graph.

Testing planarity of partially embedded graphs

This work shows that the planarity question remains polynomial-time solvable, and implies that no dynamic programming is needed for a decision algorithm and that the elements of the decomposition can be processed independently.

Extending Partial Representations of Subclasses of Chordal Graphs

Complexity of the partial representation extension problem for chordal graphs is investigated, asking whether it is possible to construct a representation inside a modified tree T which extends thepartial representation (keeps the pre-drawn subtrees unchanged).

Maximum weight independent sets and cliques in intersection graphs of filaments

Covering and coloring polygon-circle graphs