The connected critical node problem (Q2672625)

From MaRDI portal

Revision as of 16:11, 19 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	The connected critical node problem	scientific article

Statements

scholarly article

0 references

The connected critical node problem (English)

0 references

Pierre Hosteins

0 references

Rosario Scatamacchia

0 references

Roberto Aringhieri

0 references

0 references

Theoretical Computer Science

0 references

publication date

13 June 2022

0 references

zbMATH Keywords

critical node problem

0 references

complexity

0 references

dynamic programming

0 references

treewidth

0 references

trees

0 references

series-parallel graphs

0 references

K-way vertex cut problem

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.tcs.2022.05.011

0 references

Hybrid constructive heuristics for the critical node problem

0 references

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

0 references

Polynomial and pseudo-polynomial time algorithms for different classes of the distance critical node problem

0 references

Complexity of Finding Embeddings in a <i>k</i>-Tree

0 references

Detecting critical nodes in sparse graphs

0 references

Cardinality-Constrained Critical Node Detection Problem

0 references

Safe sets, network majority on weighted trees

0 references

Complexity and approximability of the <i>k</i>‐way vertex cut

0 references

A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

0 references

Identifying sets of key players in a social network

0 references

A Depth-First Dynamic Programming Algorithm for the Tree Knapsack Problem

0 references

Complexity of the critical node problem over trees

0 references

On the approximability of positive influence dominating set in social networks

0 references

Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs

0 references

Safe set problem on graphs

0 references

0 references

Primal-dual approximation algorithms for integral flow and multicut in trees

0 references

Network interdiction via a critical disruption path: branch-and-price algorithms

0 references

On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees

0 references

Treewidth. Computations and approximations

0 references

A polynomial-time algorithm for finding critical nodes in bipartite permutation graphs

0 references

Component-cardinality-constrained critical node problem in graphs

0 references

The critical node detection problem in networks: a survey

0 references

An ILP based memetic algorithm for finding minimum positive influence dominating sets in social networks

0 references

Modeling \(s-t\) path availability to support disaster vulnerability assessment of network infrastructure

0 references

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

0 references

Exact interdiction models and algorithms for disconnecting networks via node deletions

0 references

Linear-time computability of combinatorial problems on series-parallel graphs

0 references

The Recognition of Series Parallel Digraphs

0 references

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

0 references

An integer programming framework for critical elements detection in graphs

0 references

Deterministic network interdiction

0 references

Epidemic dynamics on complex networks

0 references

Identifiers

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

10.1016/J.TCS.2022.05.011

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2672625

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