Parameterized algorithms for finding highly connected solution

DOI10.1007/978-3-031-09574-0_1MaRDI QIDQ5918560zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Parameterized algorithms for finding highly connected solution
• scientific article; zbMATH DE number 7650221
• Parameterized algorithms to preserve connectivity
• Efficient Solution of Connectivity Problems on Hierarchically Defined Graphs
• Optimal algorithms for finding connected components of an unknown graph
• An Optimal Randomized Parallel Algorithm for Finding Connected Components in a Graph
• Parameterized complexity of secluded connectivity problems
• Parameterized complexity of secluded connectivity problems
• An optimal parallel connectivity algorithm
• Parallel algorithms for connectivity problems in graph theory

Cites work

• Fundamentals of parameterized complexity
• Graph minors. XIII: The disjoint paths problem
• scientific article; zbMATH DE number 2234775 (Why is no real title available?)
• Kernelization. Theory of parameterized preprocessing
• Node-Deletion Problems on Bipartite Graphs
• Parameterized algorithms
• Parameterized complexity of Vertex Cover variants
• The Effect of a Connectivity Requirement on the Complexity of Maximum Subgraph Problems
• The node-deletion problem for hereditary properties is NP-complete

Cited in

(2)

• \(p\)-edge/vertex-connected vertex cover: parameterized and approximation algorithms
• Parameterized algorithms for finding highly connected solution

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5918560)