On the public citation graph
Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs
0 signed · 157 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.
1 of the 58 references listed on this page is in the Retraction Watch database as retracted (export 2026-11-11): 10.1007/978-3-540-69304-8_50 (notice 2016-05-01).
Dataset join, best-effort; this page does not check the publisher record. Retraction Watch data via Crossref Labs, used with credit; OpenCitations Index (CC0) and Meta (CC BY 4.0); dataset doi:10.7910/DVN/WT8VOA (CC BY 4.0).
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.1002/bltj.10093openalex-snapshot
A network survivability model for critical national infrastructures
inferredcites →https://doi.org/10.1002/ett.4460110203openalex-snapshot
Measuring the Survivability of a Network: Connectivity and Rest‐Connectivity
inferredcites →https://doi.org/10.1002/net.20072openalex-snapshot
Design of Survivable Networks: A survey
inferredcites →https://doi.org/10.1007/978-0-387-30165-5openalex-snapshot
Handbook of Optimization in Telecommunications
inferredcites →https://doi.org/10.1007/978-3-540-68056-7_12openalex-snapshot
Bounding Network Interdiction Vulnerability Through Cutset Identification
inferredcites →https://doi.org/10.1007/978-3-540-69304-8_50openalex-snapshot
Retracted: Detecting Hidden Hierarchy in Terrorist Networks: Some Case Studies
inferredcites →https://doi.org/10.1007/s00037-006-0210-9openalex-snapshot
ON THE HARDNESS OF APPROXIMATING MULTICUT AND SPARSEST-CUT
inferredcites →https://doi.org/10.1007/s00168-008-0235-xopenalex-snapshot
Exploring the vulnerability of network infrastructure to disruption
inferredcites →https://doi.org/10.1007/s10109-006-0039-4openalex-snapshot
Critical network infrastructure analysis: interdiction and system flow
inferredcites →https://doi.org/10.1007/s10588-006-7084-xopenalex-snapshot
Identifying sets of key players in a social network
inferredcites →https://doi.org/10.1007/s10898-006-9067-3openalex-snapshot
Survivable network design under optimal and heuristic interdiction scenarios
inferredcites →https://doi.org/10.1016/0166-218x(90)90133-wopenalex-snapshot
Sparsest cuts and bottlenecks in graphs
inferredcites →https://doi.org/10.1016/0166-218x(94)90171-6openalex-snapshot
Network flows: Theory, algorithms and applications
inferredcites →https://doi.org/10.1016/0378-8733(78)90021-7openalex-snapshot
Centrality in social networks conceptual clarification
inferredcites →https://doi.org/10.1016/0895-7177(93)90236-ropenalex-snapshot
Deterministic network interdiction
inferredcites →https://doi.org/10.1016/j.cnsns.2009.05.002openalex-snapshot
Application of modal analysis in assessing attack vulnerability of complex networks
inferredcites →https://doi.org/10.1016/j.cor.2007.09.004openalex-snapshot
Modeling – path availability to support disaster vulnerability assessment of network infrastructure
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.cor.2011.02.016openalex-snapshot
Complexity of the critical node problem over trees
inferredcites →https://doi.org/10.1016/j.disopt.2012.07.001openalex-snapshot
Exact interdiction models and algorithms for disconnecting networks via node deletions
inferredcites →https://doi.org/10.1016/j.ipl.2005.10.005openalex-snapshot
An -approximation algorithm for directed sparsest cut
inferredcites →https://doi.org/10.1016/j.socnet.2005.11.005openalex-snapshot
A Graph-theoretic perspective on centrality
inferredcites →https://doi.org/10.1016/j.socnet.2008.03.004openalex-snapshot
The use of sparsest cuts to reveal the hierarchical community structure of social networks
inferredcites →https://doi.org/10.1016/j.tra.2005.11.003openalex-snapshot
Importance and exposure in road network vulnerability analysis
inferredcites →https://doi.org/10.1016/s0166-218x(03)00439-6openalex-snapshot
Sparsest cuts and concurrent flows in product graphs
inferredcites →https://doi.org/10.1016/s0377-2217(03)00135-8openalex-snapshot
A cutting plane algorithm for computing k-edge survivability of a network
inferredcites →https://doi.org/10.1038/30918openalex-snapshot
Collective dynamics of ‘small-world’ networks
inferredcites →https://doi.org/10.1038/35019019openalex-snapshot
Error and attack tolerance of complex networks
inferredcites →https://doi.org/10.1049/iet-gtd.2009.0098openalex-snapshot
Bilevel programming applied to power system vulnerability analysis under multiple contingencies
inferredcites →https://doi.org/10.1073/pnas.012582999openalex-snapshot
Random graph models of social networks
inferredcites →https://doi.org/10.1080/07408170600729192openalex-snapshot
Algorithms for discrete and continuous multicommodity flow network interdiction problems
inferredcites →https://doi.org/10.1080/0740817x.2011.602659openalex-snapshot
Multi-period network interdiction problems with applications to city-level drug enforcement
inferredcites →https://doi.org/10.1080/10020070612330019openalex-snapshot
Epidemic dynamics on complex networks*
inferredcites →https://doi.org/10.1093/oso/9780198533863.001.0001openalex-snapshot
Network Reliability and Algebraic Structures
inferredcites →https://doi.org/10.1103/physreve.69.045104openalex-snapshot
Model for cascading failures in complex networks
inferredcites →https://doi.org/10.1103/physreve.71.015103openalex-snapshot
Vulnerability and protection of infrastructure networks
inferredcites →https://doi.org/10.1103/physrevlett.91.247901openalex-snapshot
Efficient Immunization Strategies for Computer Networks and Populations
inferredcites →https://doi.org/10.1109/infcom.2010.5462098openalex-snapshot
On Approximation of New Optimization Methods for Assessing Network Vulnerability
inferredcites →https://doi.org/10.1109/sfcs.1988.21960openalex-snapshot
Polynomial algorithm for the k-cut problem
inferredcites →https://doi.org/10.1109/tpwrs.2004.825888openalex-snapshot
Analysis of Electric Grid Security Under Terrorist Threat
inferredcites →https://doi.org/10.1111/j.1467-8306.2006.00499.xopenalex-snapshot
Vital Nodes, Interconnected Infrastructures, and the Geographies of Network Survivability
inferredcites →https://doi.org/10.1111/j.1468-2257.2008.00447.xopenalex-snapshot
A Methodological Overview of Network Vulnerability Analysis
inferredcites →https://doi.org/10.1137/0211023openalex-snapshot
The Recognition of Series Parallel Digraphs
inferredcites →https://doi.org/10.1137/080731049openalex-snapshot
$O(\sqrt{\logn})$ Approximation to SPARSEST CUT in $\tilde{O}(n^2)$ Time
inferredcites →https://doi.org/10.1145/1060590.1060673openalex-snapshot
Euclidean distortion and the sparsest cut
inferredcites →https://doi.org/10.1145/322326.322328openalex-snapshot
Linear-time computability of combinatorial problems on series-parallel graphs
inferredcites →https://doi.org/10.1145/800133.804355openalex-snapshot
Node-and edge-deletion NP-complete problems
inferredcites →https://doi.org/10.1177/0160017607308679openalex-snapshot
Comparative Approaches for Assessing Network Vulnerability
inferredcites →https://doi.org/10.1287/inte.1060.0252openalex-snapshot
Defending Critical Infrastructure
inferredcites →https://doi.org/10.1287/moor.10.2.180openalex-snapshot
A Best Possible Heuristic for the k-Center Problem
inferredcites →https://doi.org/10.1287/moor.19.1.24openalex-snapshot
A Polynomial Algorithm for the k-cut Problem for Fixed k
inferredcites →https://doi.org/10.1287/opre.46.2.184openalex-snapshot
Stochastic Network Interdiction
inferredcites →https://doi.org/10.2307/2583863openalex-snapshot
Network Flows: Theory, Algorithms, and Applications.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4877057openalex-extracted
Destroying Densest Subgraphs is Hard
inferred← citeshttps://doi.org/10.1002/cpe.7359openalex-snapshot
Fault‐tolerance based on augmenting approach in wireless sensor networks
inferred← citeshttps://doi.org/10.1002/net.21622openalex-snapshot
Critical nodes for distance‐based connectivity and related problems in graphs
inferred← citeshttps://doi.org/10.1002/net.21664openalex-snapshot
The wireless network jamming problem subject to protocol interference
inferred← citeshttps://doi.org/10.1002/net.21671openalex-snapshot
Local search metaheuristics for the critical node problem
inferred← citeshttps://doi.org/10.1002/net.21761openalex-snapshot
Critical arcs detection in influence networks
inferred← citeshttps://doi.org/10.1002/net.21834openalex-snapshot
Detecting critical node structures on graphs: A mathematical programming approach
inferred← citeshttps://doi.org/10.1002/net.21948openalex-snapshot
The stochastic critical node problem over trees
inferred← citeshttps://doi.org/10.1002/net.21996openalex-snapshot
In search of network resilience: An optimization‐based view
inferred← citeshttps://doi.org/10.1007/978-1-4614-4109-0_2openalex-snapshot
Selected Topics in Critical Element Detection
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-030-87869-6_48openalex-snapshot
Critical Node Detection for Maximization of Connected Components: An Extremal Optimization Approach
inferred← citeshttps://doi.org/10.1007/978-3-031-14714-2_23openalex-snapshot
The Combined Critical Node and Edge Detection Problem. An Evolutionary Approach
inferred← citeshttps://doi.org/10.1007/978-3-642-30850-5_34openalex-snapshot
A Decomposition Approach for Solving Critical Clique Detection Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-54140-7_11openalex-snapshot
Modelling Critical Node Attacks in MANETs
inferred← citeshttps://doi.org/10.1007/978-981-99-5491-9_7openalex-snapshot
Modeling and Exact Solution Approaches for the Distance-Based Critical Node and Edge Detection Problems
inferred← citeshttps://doi.org/10.1007/s00500-019-03824-8openalex-snapshot
The bi-objective critical node detection problem with minimum pairwise connectivity and cost: theory and algorithms
inferred← citeshttps://doi.org/10.1007/s10288-020-00456-9openalex-snapshot
Models and algorithms for decomposition problems
inferred← citeshttps://doi.org/10.1007/s10288-022-00518-0openalex-snapshot
Critical node/edge detection problems on trees
inferred← citeshttps://doi.org/10.1007/s10479-016-2110-yopenalex-snapshot
Hybrid constructive heuristics for the critical node problem
inferred← citeshttps://doi.org/10.1007/s10878-014-9730-4openalex-snapshot
An integer programming framework for critical elements detection in graphs
inferred← citeshttps://doi.org/10.1007/s10878-014-9742-0openalex-snapshot
Bound and exact methods for assessing link vulnerability in complex networks
inferred← citeshttps://doi.org/10.1007/s11067-018-9407-0openalex-snapshot
Optimal Detection of Critical Nodes: Improvements to Model Structure and Performance
inferred← citeshttps://doi.org/10.1007/s11390-024-2850-0openalex-snapshot
Heuristic Search with Cut Point Based Strategy for Critical Node Problem
inferred← citeshttps://doi.org/10.1007/s11590-013-0666-xopenalex-snapshot
Exact identification of critical nodes in sparse networks via new compact formulations
inferred← citeshttps://doi.org/10.1007/s11590-018-1371-6openalex-snapshot
A polynomial-time algorithm for finding critical nodes in bipartite permutation graphs
inferred← citeshttps://doi.org/10.1007/s11750-021-00600-6openalex-snapshot
Interdicting facilities in tree networks
inferred← citeshttps://doi.org/10.1007/s12532-022-00228-yopenalex-snapshot
Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations
inferred← citeshttps://doi.org/10.1007/s40747-016-0006-8openalex-snapshot
Critical nodes identification in complex systems
inferred← citeshttps://doi.org/10.1016/j.adhoc.2024.103744openalex-snapshot
Distributed Detecting of Critical Nodes for Maximization of Connected Components in Wireless Multi-hop Networks
inferred← citeshttps://doi.org/10.1016/j.cnsns.2013.04.030openalex-snapshot
Analysis of complex network performance and heuristic node removal strategies
inferred← citeshttps://doi.org/10.1016/j.cor.2018.02.020openalex-snapshot
A mixed-integer programming approach for locating jamming devices in a flow-jamming attack
inferred← citeshttps://doi.org/10.1016/j.cor.2018.04.012openalex-snapshot
Improved formulations for minimum connectivity network interdiction problems
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.1016/j.cor.2021.105254openalex-snapshot
Efficient methods for the distance-based critical node detection problem in complex networks
inferred← citeshttps://doi.org/10.1016/j.cosrev.2018.02.002openalex-snapshot
The Critical Node Detection Problem in networks: A survey
inferred← citeshttps://doi.org/10.1016/j.dam.2013.03.021openalex-snapshot
Identifying critical nodes in undirected graphs: Complexity results and polynomial algorithms for the case of bounded treewidth
inferred← citeshttps://doi.org/10.1016/j.dam.2015.01.043openalex-snapshot
Component-cardinality-constrained critical node problem in graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2017.12.035openalex-snapshot
Polynomial and pseudo-polynomial time algorithms for different classes of the Distance Critical Node Problem
inferred← citeshttps://doi.org/10.1016/j.disopt.2012.07.001openalex-snapshot
Exact interdiction models and algorithms for disconnecting networks via node deletions
inferred← citeshttps://doi.org/10.1016/j.disopt.2025.100889openalex-snapshot
The k -way vertex cut problem on bipartite graphs: Complexity results and algorithms
inferred← citeshttps://doi.org/10.1016/j.ejco.2021.100007openalex-snapshot
A Survey on Mixed-Integer Programming Techniques in Bilevel Optimization
inferred← citeshttps://doi.org/10.1016/j.ejor.2015.05.037openalex-snapshot
Minimum edge blocker dominating set problem
inferred← citeshttps://doi.org/10.1016/j.endm.2014.11.006openalex-snapshot
VNS solutions for the Critical Node Problem
inferred← citeshttps://doi.org/10.1016/j.endm.2016.03.047openalex-snapshot
A Genetic Algorithm for a class of Critical Node Problems
inferred← citeshttps://doi.org/10.1016/j.engappai.2016.06.010openalex-snapshot
A general Evolutionary Framework for different classes of Critical Node Problems
inferred← citeshttps://doi.org/10.1016/j.eswa.2016.08.051openalex-snapshot
System vulnerability assessment and critical nodes identification
inferred← citeshttps://doi.org/10.1016/j.eswa.2025.129599openalex-snapshot
DPCND: A dual-population based evolutionary approach for critical node detection problem in complex networks
inferred← citeshttps://doi.org/10.1016/j.ins.2023.119140openalex-snapshot
Identifying the cardinality-constrained critical nodes with a hybrid evolutionary algorithm
inferred← citeshttps://doi.org/10.1016/j.ins.2026.123492openalex-snapshot
RHMGSA: Reinforcement learning-guided evolutionary search for critical node detection
inferred← citeshttps://doi.org/10.1016/j.jcss.2025.103635openalex-snapshot
Destroying Densest Subgraphs is Hard
inferred← citeshttps://doi.org/10.1016/j.jisa.2020.102471openalex-snapshot
Measuring cyber-physical security in industrial control systems via minimum-effort attack strategies
inferred← citeshttps://doi.org/10.1016/j.jnca.2016.09.003openalex-snapshot
Optimization based spectral partitioning for node criticality assessment
inferred← citeshttps://doi.org/10.1016/j.jocs.2022.101738openalex-snapshot
Comparative analysis of centrality measures for identifying critical nodes in complex networks
inferred← citeshttps://doi.org/10.1016/j.physa.2019.122322openalex-snapshot
Detecting multiple key players under the positive effect by using a distance-based connectivity approach
inferred← citeshttps://doi.org/10.1016/j.physa.2019.122862openalex-snapshot
Critical node detection problem for complex network in undirected weighted networks
inferred← citeshttps://doi.org/10.1016/j.procs.2025.10.289openalex-snapshot
Generalized Capacitated Vertex Separator Problem: Models and Algorithms
inferred← citeshttps://doi.org/10.1016/j.ress.2018.06.005openalex-snapshot
Finding minimum node separators: A Markov chain Monte Carlo method
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.05.011openalex-snapshot
The Connected Critical Node Problem
inferred← citeshttps://doi.org/10.1038/s41467-025-63489-wopenalex-snapshot
Modeling resource consumption in the US air transportation system via minimum-cost percolation
inferred← citeshttps://doi.org/10.1063/5.0005452openalex-snapshot
Compact models for influential nodes identification problem in directed networks
inferred← citeshttps://doi.org/10.1080/01605682.2021.1913078openalex-snapshot
A heuristic approach for the distance-based critical node detection problem in complex networks
inferred← citeshttps://doi.org/10.1080/10556788.2016.1214958openalex-snapshot
Robustness of solutions to critical node detection problems with imperfect data: a computational study
inferred← citeshttps://doi.org/10.1109/ccis.2018.8691236openalex-snapshot
Dynamically Exchanging Nodes of the Critical Node Problem
inferred← citeshttps://doi.org/10.1109/icctec.2017.00300openalex-snapshot
Vulnerabilities of Mobile Ad Hoc Network Using Centrality Metrics
inferred← citeshttps://doi.org/10.1109/isncc58260.2023.10323870openalex-snapshot
Network Vulnerability Assessment Using Critical Nodes Identification
inferred← citeshttps://doi.org/10.1109/jetcas.2023.3290319openalex-snapshot
DND: Deep Learning-Based Directed Network Disintegrator
inferred← citeshttps://doi.org/10.1109/pci60110.2023.10326015openalex-snapshot
A Depth-First Search-Based Algorithm for the Minimization of the Largest Connected Component in Networks
inferred← citeshttps://doi.org/10.1109/rndm.2014.7014948openalex-snapshot
Analysis of critical node attacks in mobile ad hoc networks
inferred← citeshttps://doi.org/10.1109/tase.2024.3399322openalex-snapshot
Learning to Detect Critical Nodes in Sparse Graphs via Feature Importance Awareness
inferred← citeshttps://doi.org/10.1109/tccn.2024.3427123openalex-snapshot
An Evolutionary Multitasking Method for Multi-Objective Critical Node Detection on Interdependent Networks
inferred← citeshttps://doi.org/10.1109/tcss.2022.3195525openalex-snapshot
Influential Node Detection and Ranking With Fusion of Heterogeneous Social Media Information
inferred← citeshttps://doi.org/10.1109/tcss.2022.3217071openalex-snapshot
An Improved Differential Evolution Framework Using Network Topology Information for Critical Nodes Detection
inferred← citeshttps://doi.org/10.1109/tcyb.2018.2848116openalex-snapshot
Memetic Search for Identifying Critical Nodes in Sparse Graphs
inferred← citeshttps://doi.org/10.1109/tits.2023.3270334openalex-snapshot
Frequent Itemset-Driven Search for Finding Minimal Node Separators and its Application to Air Transportation Network Analysis
inferred← citeshttps://doi.org/10.1109/tnet.2014.2317486openalex-snapshot
Network Under Joint Node and Link Attacks: Vulnerability Assessment Methods and Analysis
inferred← citeshttps://doi.org/10.1109/tnet.2021.3056450openalex-snapshot
Optimizing the Maximum Vertex Coverage Attacks Under Knapsack Constraint
inferred← citeshttps://doi.org/10.1109/tnet.2023.3308142openalex-snapshot
Detecting the Most Vital Articulation Points in Wireless Multi-Hop Networks
inferred← citeshttps://doi.org/10.1109/tnse.2020.2972980openalex-snapshot
Multi-Objective Optimization of Critical Node Detection Based on Cascade Model in Complex Networks
inferred← citeshttps://doi.org/10.1109/tnse.2021.3110195openalex-snapshot
Towards Minimizing the $R$ Metric for Measuring Network Robustness
inferred← citeshttps://doi.org/10.1109/tr.2025.3586415openalex-snapshot
Critical Node Detection for Enhanced Network Reliability: A Comparative Analysis Across Real-World Complex Networks
inferred← citeshttps://doi.org/10.1142/s0217595920500414openalex-snapshot
The Critical Node Problem Based on Connectivity Index and Properties of Components on Trees
inferred← citeshttps://doi.org/10.1145/3451169openalex-snapshot
Analysing Mission-critical Cyber-physical Systems with AND/OR Graphs and MaxSAT
inferred← citeshttps://doi.org/10.1145/3774904.3792316openalex-snapshot
Network Dismantling via Reverse Dismantling: Static and Dynamic Algorithms
inferred← citeshttps://doi.org/10.11648/j.ajam.20251305.13openalex-snapshot
Efficient Algorithms for Critical Node Detection on Path Graphs with Binary Connection Metrics
inferred← citeshttps://doi.org/10.1287/deca.2015.0325openalex-snapshot
Sequential Shortest Path Interdiction with Incomplete Information
inferred← citeshttps://doi.org/10.1287/educ.1120.0098openalex-snapshot
Teaching Dynamic Programming and Duality Insights Using Games, Interdiction, and Robust Optimization
inferred← citeshttps://doi.org/10.1287/ijoc.2015.0671openalex-snapshot
Robust Critical Node Selection by Benders Decomposition
inferred← citeshttps://doi.org/10.1287/ijoc.2018.0829openalex-snapshot
Finding Critical Links for Closeness Centrality
inferred← citeshttps://doi.org/10.1287/opre.2020.2014openalex-snapshot
Multilevel Approaches for the Critical Node Problem
inferred← citeshttps://doi.org/10.1287/opre.2021.2110openalex-snapshot
Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem
inferred← citeshttps://doi.org/10.1371/journal.pone.0039788openalex-snapshot
Robustness Elasticity in Complex Networks
inferred← citeshttps://doi.org/10.23919/jsee.2023.000080openalex-snapshot
Complex systems and network science: a survey
inferred← citeshttps://doi.org/10.3969/j.issn.1004-4132.2010.05.003openalex-snapshot
LLR calculation for LDPC coded SCBT in 60 GHz WPAN
inferred← citeshttps://doi.org/10.4018/978-1-7998-4186-9.ch012openalex-snapshot
Critical Nodes Detection in IoT-Based Cyber-Physical Systems
inferred← citeshttps://doi.org/10.70675/72f96944zb711z4ad5z9d5bzaac3410bdf92openalex-snapshot
TDIness and Multicuts
inferred← citeshttps://doi.org/10.7717/peerj-cs.1351openalex-snapshot
The critical node detection problem in hypergraphs using weighted node degree centrality
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.