scientific article; zbMATH DE number 7204494

DOI10.4230/LIPIcs.ICALP.2017.42zbMath1441.68184arXiv1704.08235MaRDI QIDQ5111373

Sebastian Krinninger, Thomas Dueholm Hansen, Nikos Parotsidis, Loukas Georgiadis, Giuseppe F. Italiano

Publication date: 27 May 2020

Full work available at URL: https://arxiv.org/abs/1704.08235

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

dynamic graph algorithmsdominator treedecremental algorithmsstrong connectivity under failures

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (2)

Strong Connectivity in Directed Graphs under Failures, with Applications ⋮ Dynamic Dominators and Low-High Orders in DAGs

This page was built for publication: