Maximum rooted connected expansion

DOI10.4230/LIPICS.MFCS.2018.25MaRDI QIDQ5005125zbMATH OpenFDO

Authors Ioannis Lamprou, Russell Martin, Sven Schewe, Ioannis Sigalas, V. Zissimopoulos

Publication date 4 August 2021

Full work available at URL https://arxiv.org/abs/1806.09549

zbMATH Keywords

dominationexpansionprefetchingratio

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Maximum rooted connected expansion
• To satisfy impatient web surfers is hard
• Connected surveillance game
• scientific article; zbMATH DE number 1300393
• scientific article; zbMATH DE number 2081037

Cites work

• Analyzing the optimal neighborhood: algorithms for budgeted and partial connected dominating set problems
• Dominating cliques in chordal graphs
• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 1445375 (Why is no real title available?)
• On an isoperimetric problem for Hamming graphs

Cited in

(3)

• Maximum rooted connected expansion
• Improved budgeted connected domination and budgeted edge-vertex domination
• Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination

This page was built for publication: Maximum rooted connected expansion

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