On the public citation graph
Computing Critical Nodes in Directed Graphs
0 signed · 37 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-642-15883-4_8openalex-snapshot
Finding Critical Nodes for Inhibiting Diffusion of Complex Contagions in Social Networks
inferredcites →https://doi.org/10.1007/978-3-662-47672-7_58openalex-snapshot
Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time
inferredcites →https://doi.org/10.1007/bf00268499openalex-snapshot
Edge-disjoint spanning trees and depth-first search
inferredcites →https://doi.org/10.1016/j.cor.2008.08.016openalex-snapshot
Detecting critical nodes in sparse graphs
inferredcites →https://doi.org/10.1016/j.jcss.2006.02.003openalex-snapshot
Inoculation strategies for victims of viruses and the sum-of-squares partition problem
inferredcites →https://doi.org/10.1016/j.tcs.2011.11.011openalex-snapshot
Finding strong bridges and strong articulation points in linear time
inferredcites →https://doi.org/10.1080/0022250x.2001.9990249openalex-snapshot
A faster algorithm for betweenness centrality*
inferredcites →https://doi.org/10.1103/physrevlett.91.247901openalex-snapshot
Efficient Immunization Strategies for Computer Networks and Populations
inferredcites →https://doi.org/10.1109/tnet.2011.2170849openalex-snapshot
On New Approaches of Assessing Network Vulnerability: Hardness and Approximation
inferredcites →https://doi.org/10.1109/tnet.2012.2215882openalex-snapshot
On the Discovery of Critical Links and Nodes for Assessing Network Vulnerability
inferredcites →https://doi.org/10.1126/science.286.5439.509openalex-snapshot
Emergence of Scaling in Random Networks
inferredcites →https://doi.org/10.1137/0201010openalex-snapshot
Depth-First Search and Linear Graph Algorithms
inferredcites →https://doi.org/10.1137/0203006openalex-snapshot
Finding Dominators in Directed Graphs
inferredcites →https://doi.org/10.1137/070693217openalex-snapshot
Linear-Time Algorithms for Dominators and Other Path-Evaluation Problems
inferredcites →https://doi.org/10.1137/1.9781611974768openalex-snapshot
2017 Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments (ALENEX)
inferredcites →https://doi.org/10.1137/1.9781611974768.4openalex-snapshot
Computing Critical Nodes in Directed Graphs
inferredcites →https://doi.org/10.1145/115372.115320openalex-snapshot
Efficiently computing static single assignment form and the control dependence graph
inferredcites →https://doi.org/10.1145/2542182.2542192openalex-snapshot
Computationally efficient link prediction in a variety of social networks
inferredcites →https://doi.org/10.1145/2968448openalex-snapshot
2-Edge Connectivity in Directed Graphs
inferredcites →https://doi.org/10.1145/956750.956769openalex-snapshot
Maximizing the spread of influence through a social network
inferredcites →https://doi.org/10.1186/s40649-015-0010-yopenalex-snapshot
Efficiently identifying critical nodes in large complex networks
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-44685-7_3openalex-snapshot
Vulnerability Evaluation of Networks to Multiple Failures Based on Critical Nodes and Links
inferred← citeshttps://doi.org/10.1007/978-3-030-86271-8_11openalex-snapshot
A Simple Genetic Algorithm for the Critical Node Detection Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-90714-2_1openalex-snapshot
A Network Approach to Aquatic Food Web Dynamics
inferred← citeshttps://doi.org/10.1016/j.cor.2020.105138openalex-snapshot
EIA-CNDP: An exact iterative algorithm for critical node detection problem
inferred← citeshttps://doi.org/10.1063/5.0005452openalex-snapshot
Compact models for influential nodes identification problem in directed networks
inferred← citeshttps://doi.org/10.1093/gigascience/giaa115openalex-snapshot
Pyntacle: a parallel computing-enabled framework for large-scale network biology analysis
inferred← citeshttps://doi.org/10.1109/access.2022.3213044openalex-snapshot
Identifying the Top-k Influential Spreaders in Social Networks: a Survey and Experimental Evaluation
inferred← citeshttps://doi.org/10.1109/bibm47256.2019.8983221openalex-snapshot
Critical nodes reveal peculiar features of human essential genes and protein interactome
inferred← citeshttps://doi.org/10.1109/saner-c66551.2025.00020openalex-snapshot
Links Between Package Popularity, Criticality, and Security in Software Ecosystems
inferred← citeshttps://doi.org/10.1109/tcss.2022.3193439openalex-snapshot
Context-Driven-Based Community Detection
inferred← citeshttps://doi.org/10.1109/tnnls.2021.3056080openalex-snapshot
Fast Self-Supervised Clustering With Anchor Graph
inferred← citeshttps://doi.org/10.1137/19m1258530openalex-snapshot
Strong Connectivity in Directed Graphs under Failures, with Applications
inferred← citeshttps://doi.org/10.1145/3375246.3375255openalex-snapshot
Heuristic-aided symbolic simulation for trickle-based wireless sensors networks configuration
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.