Parameterized algorithms for finding highly connected solution

DOI10.1007/978-3-031-09574-0_1OpenAlexW4285198879MaRDI QIDQ5918560

Ankit Abhinav, Susobhan Bandopadhyay, Aritra Banik, Saket Saurabh

Publication date: 11 November 2022

Published in: Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-09574-0_1

zbMATH Keywords

connectivityparameterized algorithmssubset problems

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

\(p\)-edge/vertex-connected vertex cover: parameterized and approximation algorithms

Cites Work

• Unnamed Item
• 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
• The Effect of a Connectivity Requirement on the Complexity of Maximum Subgraph Problems
• Node-Deletion Problems on Bipartite Graphs
• Kernelization
• Parameterized Algorithms

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