scientific article; zbMATH DE number 6469230
From MaRDI portal
Publication:5501349
zbMath1318.68188MaRDI QIDQ5501349
Loukas Georgiadis, Robert Endre Tarjan
Publication date: 3 August 2015
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10)
Related Items
Strong articulation points and strong bridges in large scale graphs, On succinct representations of binary trees, Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time, Prime normal form and equivalence of simple grammars, Average case analysis of DJ graphs, Identifying structural hole spanners to maximally block information propagation, A space-efficient algorithm for finding strongly connected components, Finding dominators via disjoint set union, A \(\min\)-\(\max\) relation in flowgraphs and some applications, Criticality: static profiling for real-time programs, On space efficient two dimensional range minimum data structures, Finding hypernetworks in directed hypergraphs
