Deterministic replacement path covering

DOI10.1145/3673760MaRDI QIDQ7023539zbMATH OpenFDO

Authors C. S. Karthik, M. Parter

Publication date 21 February 2025

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

zbMATH Keywords

deterministic algorithmsspannersdistance sensitivity oraclesfault-tolerant graph algorithms

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20) Analysis of algorithms (68W40)

This page was built for publication: Deterministic replacement path covering

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