scientific article; zbMATH DE number 7204494

DOI10.4230/LIPICS.ICALP.2017.42zbMATH Open1441.68184arXiv1704.08235MaRDI QIDQ5111373FDOQ5111373

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 of this publication is not available (Why is that?)

zbMATH Keywords

dynamic graph algorithmsdominator treedecremental algorithmsstrong connectivity under failures

Mathematics Subject Classification ID

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

Cited In (2)

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

This page was built for publication:

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