scientific article; zbMATH DE number 1522922

zbMATH Open0964.05050MaRDI QIDQ4511218FDOQ4511218

Authors: Mirela Damian-Iordache, Sriram Pemmaraju 

Publication date: 6 March 2001

Title of this publication is not available (Why is that?)

Recommendations

• The complexity of domination problems in circle graphs
• Parameterized domination in circle graphs
• scientific article; zbMATH DE number 1445364
• Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs
• scientific article; zbMATH DE number 1522921

zbMATH Keywords

computational complexityapproximation algorithmstotal dominating setcircle graphconnected dominating set

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph representations (geometric and intersection representations, etc.) (05C62)

Cited In (7)

• The complexity of domination problems in circle graphs
• On dominating set of some subclasses of string graphs
• A (2+ε)-Approximation Scheme for Minimum Domination on Circle Graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• A constant factor approximation algorithm for boxicity of circular arc graphs
• Leaf sector covers with applications on circle graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4511218)