scientific article; zbMATH DE number 2019630

MaRDI QIDQ4440433zbMATH OpenFDO

Authors

Publication date 17 December 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2483/24830126.htm

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Randomized greedy algorithms for finding smallk-dominating sets of regular graphs
• On the Independent Domination Number of Random Regular Graphs
• A new kind of domination in regular graphs
• Connected domination of regular graphs
• scientific article; zbMATH DE number 2089976

Cited in

(15)

• A distributed algorithm for \(k\)-dominating sets
• scientific article; zbMATH DE number 2089976 (Why is no real title available?)
• The expected size of the Rule k dominating set
• scientific article; zbMATH DE number 4081595 (Why is no real title available?)
• Small \(\ell\)-edge-covers in \(k\)-connected graphs
• On smallest regular graphs with a given isopart
• Randomized greedy algorithms for finding smallk-dominating sets of regular graphs
• On the Independent Domination Number of Random Regular Graphs
• Connected domination of regular graphs
• scientific article; zbMATH DE number 1875441 (Why is no real title available?)
• Small edge dominating sets of regular graphs
• A new kind of domination in regular graphs
• A greedy algorithm for the connected positive influence dominating set in \(k\)-regular graphs
• scientific article; zbMATH DE number 2011847 (Why is no real title available?)
• scientific article; zbMATH DE number 2230938 (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 Q4440433)