Addendum to “Dominator Tree Certification and Divergent Spanning Trees”

DOI10.1145/2928271zbMath1445.68162OpenAlexW2508867560MaRDI QIDQ4962633

Loukas Georgiadis, Robert Endre Tarjan

Publication date: 5 November 2018

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

Full work available at URL: https://doi.org/10.1145/2928271

zbMATH Keywords

dominatorsconnectivitydirected graphdepth-first searchflow graphfault-tolerant network design

Mathematics Subject Classification ID

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

Related Items (2)

Approximating the smallest 2-vertex connected spanning subgraph of a directed graph ⋮ Dynamic Dominators and Low-High Orders in DAGs

This page was built for publication: Addendum to “Dominator Tree Certification and Divergent Spanning Trees”