Algorithmic aspect on the minimum (weighted) doubly resolving set problem of graphs

DOI10.1007/978-3-030-27195-4_20MaRDI QIDQ6199017zbMATH OpenOpenAlexFDO

Authors Changhong Lu, Qingjie Ye, Chengru Zhu

Publication date 23 February 2024

Published in Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-27195-4_20

zbMATH Keywords

cactus graphblock graphdoubly resolving set\(k\)-edge-augmented trees

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• Algorithmic aspect on the minimum (weighted) doubly resolving set problem of graphs
• Approximability of the minimum weighted doubly resolving set problem
• On doubly resolving sets in graphs
• Graphs with doubly resolving number 2
• Minimal doubly resolving sets of necklace graph

This page was built for publication: Algorithmic aspect on the minimum (weighted) doubly resolving set problem of graphs

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