Dominators, Directed Bipolar Orders, and Independent Spanning Trees
From MaRDI portal
Publication:2843263
DOI10.1007/978-3-642-31594-7_32zbMath1272.68454OpenAlexW2165901913MaRDI QIDQ2843263
Loukas Georgiadis, Robert Endre Tarjan
Publication date: 12 August 2013
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-31594-7_32
Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)
Related Items (4)
Strong articulation points and strong bridges in large scale graphs ⋮ Linear time algorithms for two disjoint paths problems on directed acyclic graphs ⋮ Finding dominators via disjoint set union ⋮ Computing the 2-blocks of directed graphs
This page was built for publication: Dominators, Directed Bipolar Orders, and Independent Spanning Trees