Related references
Note: Only part of the references are listed.The most vital nodes with respect to independent set and vertex cover
Cristina Bazgan et al.
DISCRETE APPLIED MATHEMATICS (2011)
Matching interdiction
Rico 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)
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
