VNS solutions for the critical node problem (Q2631225)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	VNS solutions for the critical node problem	scientific article

Statements

scholarly article

0 references

VNS solutions for the critical node problem (English)

0 references

Roberto Aringhieri

0 references

Pierre Hosteins

0 references

Rosario Scatamacchia

0 references

0 references

publication date

29 July 2016

0 references

zbMATH Keywords

critical node problem

0 references

graph fragmentation

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.endm.2014.11.006

0 references

Detecting critical nodes in sparse graphs

0 references

Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth

0 references

Identifying sets of key players in a social network

0 references

Complexity of the critical node problem over trees

0 references

Variable neighbourhood search: Methods and applications

0 references

Variable neighbourhood search: methods and applications

0 references

Exact interdiction models and algorithms for disconnecting networks via node deletions

0 references

Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs

0 references

Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem

0 references

Removing Arcs from a Network

0 references

Deterministic network interdiction

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

10.1016/J.ENDM.2014.11.006

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2631225

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2631225&oldid=39170480"