Dominating sets in web graphs

DOI10.1007/978-3-540-30216-2_3MaRDI QIDQ5311172zbMATH OpenOpenAlexFDO

Authors Colin Cooper, Ralf Klasing, Michele Zito

Publication date 22 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b101552

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Lower Bounds and Algorithms for Dominating Sets in Web Graphs
• Dominating sets in social network graphs
• Dominating sets of random 2-in 2-out directed graphs
• Random procedures for dominating sets in graphs
• Connected domination of regular graphs

Cited in

(8)

• Dominating sets of random 2-in 2-out directed graphs
• Dominating sets in social network graphs
• On approximating (connected) 2-edge dominating set by a tree
• The domination number of on-line social networks and random geometric graphs
• Domination number and minimum dominating sets in pseudofractal scale-free web and Sierpiński graph
• Online Dominating Set
• Lower Bounds and Algorithms for Dominating Sets in Web Graphs
• On approximating (connected) 2-edge dominating set by a tree

This page was built for publication: Dominating sets in web graphs

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