Computing Critical Nodes in Directed Graphs

DOI10.1137/1.9781611974768.4zbMath1430.68235OpenAlexW2568823320MaRDI QIDQ5232563

Loukas Georgiadis, Giuseppe F. Italiano, Nilakantha Paudel

Publication date: 12 September 2019

Published in: 2017 Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611974768.4

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

Computing Critical Nodes in Directed Graphs ⋮ The critical node detection problem in networks: a survey

This page was built for publication: Computing Critical Nodes in Directed Graphs