scientific article; zbMATH DE number 1124601

MaRDI QIDQ4378629zbMATH OpenFDO

Authors Dieter Kratsch

Publication date 31 March 1998

zbMATH Keywords

dominating setdominationdomination algorithmssurvey

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cited in

(15)

• Algorithms in SINGULAR
• Algorithms for dominating clique problems
• On dominating sets whose induced subgraphs have a bounded diameter
• An exact algorithm for the minimum dominating clique problem
• Improved bottleneck domination algorithms
• D E K=(100)_8
• scientific article; zbMATH DE number 3918387 (Why is no real title available?)
• scientific article; zbMATH DE number 1302196 (Why is no real title available?)
• scientific article; zbMATH DE number 194559 (Why is no real title available?)
• scientific article; zbMATH DE number 7434637 (Why is no real title available?)
• Algorithms on Graphs with Small Dominating Targets
• scientific article; zbMATH DE number 958772 (Why is no real title available?)
• scientific article; zbMATH DE number 2222002 (Why is no real title available?)
• A survey on variant domination problems in geometric intersection graphs
• Improved algorithms and complexity results for power domination in 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 Q4378629)