Random procedures for dominating sets in bipartite graphs

DOI10.7151/DMGT.1494MaRDI QIDQ3059096zbMATH OpenOpenAlexFDO

Authors Sarah Artmann, Jochen Harant

Publication date 8 December 2010

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL https://www.db-thueringen.de/servlets/MCRFileNodeServlet/dbt_derivate_00046452/2083-5892_30_2010_2_277-288.pdf

zbMATH Keywords

bipartite graphdominationmultilinear functionrandom procedure

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Random procedures for dominating sets in graphs
• On the domination number of a random graph
• A note on domination parameters in random graphs
• Near-optimal dominating sets via random sampling
• Randomized algorithms and upper bounds for multiple domination in graphs and networks
• Random bipartite graphs
• Bipartite subgraphs and quasi-randomness
• Near-optimal dominating sets in dense random graphs in polynomial expected time
• Dominating sets of random 2-in 2-out directed graphs
• Bipartite Ramsey numbers of cycles for random graphs

Cited in

(6)

• Randomized algorithms and upper bounds for multiple domination in graphs and networks
• An FPTAS for the hardcore model on random regular bipartite graphs
• New probabilistic upper bounds on the domination number of a graph
• scientific article; zbMATH DE number 1334601 (Why is no real title available?)
• New probabilistic upper bounds on the domination number of a graph. II
• Random procedures for dominating sets in graphs

This page was built for publication: Random procedures for dominating sets in bipartite graphs

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