Related references
Note: Only part of the references are listed.Exact algorithms for the minimum s-club partitioning problem
Oleksandra Yezerska et al.
ANNALS OF OPERATIONS RESEARCH (2019)
On biconnected and fragile subgraphs of low diameter
Oleksandra Yezerska et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2017)
Finding k most influential edges on flow graphs
Petrie Wong et al.
INFORMATION SYSTEMS (2017)
Two extended formulations for cardinality maximum flow network interdiction problem
Maria Afshari Rad et al.
NETWORKS (2017)
A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs
Matteo Fischetti et al.
OPERATIONS RESEARCH (2017)
A class of algorithms for mixed-integer bilevel min-max optimization
Yen Tang et al.
JOURNAL OF GLOBAL OPTIMIZATION (2016)
Minimum edge blocker dominating set problem
Foad Mahdavi Pajouh et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2015)
A review on algorithms for maximum clique problems
Qinghua Wu et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2015)
Bound and exact methods for assessing link vulnerability in complex networks
T. N. Dinh et al.
JOURNAL OF COMBINATORIAL OPTIMIZATION (2014)
An integer programming framework for critical elements detection in graphs
Alexander Veremyev et al.
JOURNAL OF COMBINATORIAL OPTIMIZATION (2014)
Minimum Vertex Blocker Clique Problem
Foad Mahdavi Pajouh et al.
NETWORKS (2014)
Exact identification of critical nodes in sparse networks via new compact formulations
Alexander Veremyev et al.
OPTIMIZATION LETTERS (2014)
On the Discovery of Critical Links and Nodes for Assessing Network Vulnerability
Yilin Shen et al.
IEEE-ACM TRANSACTIONS ON NETWORKING (2013)
Critical edges/nodes for the minimum spanning tree problem: complexity and approximation
Cristina Bazgan et al.
JOURNAL OF COMBINATORIAL OPTIMIZATION (2013)
Branch and cut algorithms for detecting critical nodes in undirected graphs
Marco Di Summa et al.
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS (2012)
On New Approaches of Assessing Network Vulnerability: Hardness and Approximation
Thang N. Dinh et al.
IEEE-ACM TRANSACTIONS ON NETWORKING (2012)
Complexity of the critical node problem over trees
Marco Di Summa et al.
COMPUTERS & OPERATIONS RESEARCH (2011)
The most vital nodes with respect to independent set and vertex cover
Cristina Bazgan et al.
DISCRETE APPLIED MATHEMATICS (2011)
Network flow interdiction on planar graphs
R. Zenklusen
DISCRETE APPLIED MATHEMATICS (2010)
Blockers and transversals in some subclasses of bipartite graphs: When caterpillars are dancing on a grid
B. Ries et al.
DISCRETE MATHEMATICS (2010)
The Maximum Flow Network Interdiction Problem: Valid inequalities, integrality gaps, and approximability
Douglas S. Altner et al.
OPERATIONS RESEARCH LETTERS (2010)
Detecting critical nodes in sparse graphs
Ashwin Arulselvan et al.
COMPUTERS & OPERATIONS RESEARCH (2009)
Social contact networks for the spread of pandemic influenza in children and teenagers
Laura M. Glass et al.
BMC PUBLIC HEALTH (2008)
On short paths interdiction problems: Total and node-wise limited interdiction
Leonid Khachiyan et al.
THEORY OF COMPUTING SYSTEMS (2008)
Clique-detection models in computational biochemistry and genomics
S. Butenko et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2006)
Protein complexes and functional modules in molecular networks
V Spirin et al.
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA (2003)
An automated method for finding molecular complexes in large protein interaction networks
GD Bader et al.
BMC BIOINFORMATICS (2003)
Shortest-path network interdiction
E Israeli et al.
NETWORKS (2002)
Share Paper
