Parameterized Complexity of Edge Interdiction Problems

DOI10.1007/978-3-319-08783-2_15zbMath1423.68210arXiv1401.2532MaRDI QIDQ2920456

Jiong Guo, Yash Raj Shrestha

Publication date: 26 September 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1401.2532

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

68Q25: Analysis of algorithms and problem complexity

91A43: Games involving graphs

68R10: Graph theory (including graph drawing) in computer science

05C75: Structural characterization of families of graphs

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C22: Signed and weighted graphs