Study of the Matching Interdiction Problem in Some Molecular Graphs of Dendrimers
From MaRDI portal
Publication:2980027
DOI10.1007/978-3-319-31584-3_18zbMath1360.92138MaRDI QIDQ2980027
Nasrin Kahkeshani, Gholam Hasan Shirdel
Publication date: 27 April 2017
Published in: Distance, Symmetry, and Topology in Carbon Nanomaterials (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-31584-3_18
05C90: Applications of graph theory
92E10: Molecular structure (graph-theoretic methods, methods of differential topology, etc.)
05C22: Signed and weighted graphs
Cites Work
- The most vital nodes with respect to independent set and vertex cover
- Matching interdiction
- The multi-terminal maximum-flow network-interdiction problem
- Most vital links and nodes in weighted networks
- Deterministic network interdiction
- Exact interdiction models and algorithms for disconnecting networks via node deletions
- The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability
- Finding the n Most Vital Links in Flow Networks
- Shortest-path network interdiction
- Optimal interdiction of a supply network
- Unnamed Item