Topic
Polygon-circle graph
About: Polygon-circle graph is a research topic. Over the lifetime, 6 publications have been published within this topic receiving 89 citations.
Papers
TL;DR: An induced matching in a graph G is a set of edges, no two of which meet a common node or are joined by an edge of G, that is, an induced matching is a matching which forms an induced subgraph.
34 citations
TL;DR: P polynomial time algorithms for induced biclique optimization problems in the following families of graphs: polygon-circle graphs, 4-hole-free graphs, complements of interval-filament graphs and complement of subtree- Filament graphs are presented.
7 citations
TL;DR: In this paper, a polynomial time algorithm is presented to find a minimum weight feedback vertex set, or equivalently a maximum weight induced forest, in a circle n-gon graph with positive weights, when its intersection model by ngon-interval-filaments is given.
Abstract: A circle n-gon is the region between n or fewer non-crossing chords of a circle, no chord connecting the arcs between two other chords; the sides of a circle n-gon are either chords or arcs of the circle. A circle n-gon graph is the intersection graph of a family of circle n-gons in a circle. The family of circle trapezoid graphs is exactly the family of circle 2-gon graphs and the family of circle graphs is exactly the family of circle 1-gon graphs. The family of circle n-gon graphs contains the polygon-circle graphs which have an intersection representation by circle polygons, each polygon with at most n chords. We describe a polynomial time algorithm to find a minimum weight feedback vertex set, or equivalently, a maximum weight induced forest, in a circle n-gon graph with positive weights, when its intersection model by n-gon-interval-filaments is given.
5 citations
TL;DR: The relationship between the independently-studied polygon-circle graphs and word-representable graphs is described and it is shown that neither of these two classes is included in the other one by showing that the word- Representable Petersen graph and crown graphs are notpolygon- circle, while the non-word-Representable wheel graph W5 is polygon -circle.
5 citations
26 Jun 2012
TL;DR: A polynomial time algorithm to find in polygon-circle graphs a maximum induced complete multipartite subgraph containing an induced K2,2 and the problems have applications for clustering of proteins by PPI criteria are described.
Abstract: A graph is a multiclique if its connected components are cliques. A graph is a complete multipartite graph if it is the complement of a multiclique. A graph is a multiclique-multipartite graph if its vertex set has a partition U, W such that G(U) is complete multipartite, G(W) is a multiclique and every two vertices u(U, v(W are adjacent. We describe a polynomial time algorithm to find in polygon-circle graphs a maximum induced complete multipartite subgraph containing an induced K2,2. In addition, we describe polynomial time algorithms to find maximum induced multicliques and multiclique-multipartite subgraphs in circle graphs. These problems have applications for clustering of proteins by PPI criteria.
2 citations
Related Topics (5)
Performance Metrics
| Year | Papers |
|---|---|
| 2019 | 1 |
| 2012 | 1 |
| 2011 | 2 |
| 2006 | 1 |
| 2000 | 1 |