Graph fragmentation problem: analysis and synthesis

DOI10.1111/itor.12562OpenAlexW2803257030WikidataQ129766627 ScholiaQ129766627MaRDI QIDQ6066278

Manuel Aprile, Juan Piccini, Franco Robledo, Pablo Romero, Unnamed Author, Graciela Ferreira

Publication date: 15 November 2023

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.12562

zbMATH Keywords

computational complexitygame theorymetaheuristicsapproximation algorithmsgraph fragmentation problemvulnerability metrics

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (2)

A tight approximation algorithm for the cluster vertex deletion problem ⋮ A tight approximation algorithm for the cluster vertex deletion problem

Cites Work

• Unnamed Item
• Unnamed Item
• Minimum-weight two-connected spanning networks
• Design of survivable networks with vulnerability constraints
• Non-cooperative games
• Optimization by GRASP
• Maximal Flow Through a Network
• Complexity among combinatorial problems from epidemics
• Reducibility among Combinatorial Problems
• Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs

This page was built for publication: Graph fragmentation problem: analysis and synthesis