Monitoring graph edges via shortest paths: computational complexity and approximation algorithms https://arxiv.org/abs/2506.12021 #cs.CC
QOTO: Question Others to Teach Ourselves An inclusive, Academic Freedom, instance All cultures welcome. Hate speech and harassment strictly forbidden.