scientific article; zbMATH DE number 2019630

zbMATH Open1028.68566MaRDI QIDQ4440433FDOQ4440433

Author name not available (Why is that?)

Publication date: 17 December 2003

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

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

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)

Cited In (10)

• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• A greedy algorithm for the connected positive influence dominating set in \(k\)-regular graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• A distributed algorithm for \(k\)-dominating sets

   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 👍 👎
• Title not available (Why is that?) 👍 👎

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)