Parameterized algorithms for finding highly connected solution

DOI10.1016/j.tcs.2022.11.024OpenAlexW4310061103MaRDI QIDQ5970787

Susobhan Bandopadhyay, Ankit Abhinav, Saket Saurabh, Aritra Banik

Publication date: 21 December 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2022.11.024

zbMATH Keywords

connectivityparameterized algorithmssubset problems

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Fundamentals of parameterized complexity
• The node-deletion problem for hereditary properties is NP-complete
• Graph minors. XIII: The disjoint paths problem
• Parameterized complexity of Vertex Cover variants
• \(p\)-edge/vertex-connected vertex cover: parameterized and approximation algorithms
• The Effect of a Connectivity Requirement on the Complexity of Maximum Subgraph Problems
• Node-Deletion Problems on Bipartite Graphs
• Kernelization
• Parameterized Algorithms
• Unnamed Item

This page was built for publication: Parameterized algorithms for finding highly connected solution