Blocking optimal structures
From MaRDI portal
Publication:1752656
DOI10.1016/j.disc.2018.03.024zbMath1387.05262OpenAlexW2798185124MaRDI QIDQ1752656
Attila Bernáth, Gyula Pap, Kristóf Bérczi, Tamás Király
Publication date: 24 May 2018
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2018.03.024
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimum \(d\)-blockers and \(d\)-transversals in graphs
- Blocking optimal arborescences
- On short paths interdiction problems: Total and node-wise limited interdiction
- Computing girth and cogirth in perturbed graphic matroids
- Blocking unions of arborescences
- Connectivity interdiction
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Multicriteria global minimum cuts
- On the Problem of Decomposing a Graph into n Connected Factors
- Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
- The intractability of computing the minimum distance of a code
- Hardness and approximation for network flow interdiction
- Disjoint (s, t)‐cuts in a network