scientific article; zbMATH DE number 1522921

MaRDI QIDQ4511217zbMATH OpenFDO

Authors Mirela Damian-Iordache, Sriram Pemmaraju

Publication date 5 March 2001

zbMATH Keywords

circle graph

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 1522922
• APX-hardness of domination problems in circle graphs
• The complexity of domination problems in circle graphs
• Parameterized domination in circle graphs
• scientific article; zbMATH DE number 1445364

Cited in

(10)

• On the inapproximability of independent domination in \(2P_3\)-free perfect graphs
• APX-hardness of domination problems in circle graphs
• The complexity of domination problems in circle graphs
• Extension and its price for the connected vertex cover problem
• The complexity of dissociation set problems in graphs
• Parameterized domination in circle graphs
• Improved bottleneck domination algorithms
• scientific article; zbMATH DE number 1522922 (Why is no real title available?)
• On the max min vertex cover problem
• scientific article; zbMATH DE number 969990 (Why is no real title available?)

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 Q4511217)