Network flow interdiction on planar graphs
type: Item
instance of: scholarly article
title: Network flow interdiction on planar graphs
zbMATH Open document ID: 1209.05117
published in: Discrete Applied Mathematics
publication date: 2010-08-13T00:00:00Z
Mathematics Subject Classification ID: 05C21
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68M10
zbMATH DE Number: 5770518
zbMATH Keywords: network flow interdiction
zbMATH Keywords: network robustness
zbMATH Keywords: planar graphs
zbMATH Keywords: planar duality
zbMATH Keywords: pseudo-polynomial algorithms
author: Rico Zenklusen
MaRDI profile type: Publication
full work available at URL: j.dam.2010.04.008
OpenAlex ID: W2144824278
cites work: Q3056948
cites work: Q4452913
cites work: Stochastic network interdiction
cites work: Clustering and domination in perfect graphs
cites work: Maximal Flow Through a Network
cites work: Optimal interdiction policy for a flow network
cites work: Reformulation and sampling to solve a stochastic network interdiction problem
cites work: Q3983251
cites work: Flow in planar graphs with vertex capacities
cites work: Q4130999
cites work: Optimal interdiction of a supply network
cites work: Flow in Planar Graphs with Multiple Sources and Sinks
cites work: The network inhibition problem
cites work: Finding the n Most Vital Links in Flow Networks
cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes)
cites work: Removing Arcs from a Network
cites work: Deterministic network interdiction
DOI: 10.1016/J.DAM.2010.04.008
description: scientific article; zbMATH DE number 5770518