The complexity of domination problems in circle graphs (Q1209148)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The complexity of domination problems in circle graphs |
scientific article; zbMATH DE number 167439
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of domination problems in circle graphs |
scientific article; zbMATH DE number 167439 |
Statements
The complexity of domination problems in circle graphs (English)
0 references
16 May 1993
0 references
Circle graphs are the intersection graphs of chords of a circle. It is shown that the problems of finding a minimum dominating set, a minimum connected dominating set and a minimum total dominating set are NP- complete for circle graphs. A polynomial time algorithm for finding a minimum cardinality dominating clique in a circle graph is presented.
0 references
complexity
0 references
domination
0 references
dominating set
0 references
NP-complete
0 references
polynomial time algorithm
0 references
dominating clique
0 references
circle graphs
0 references
0.8863371014595032
0 references
0.8725128769874573
0 references
