Finding Highly Connected Subgraphs

DOI10.1007/978-3-662-46078-8_21zbMath1432.68358OpenAlexW270827711MaRDI QIDQ5175112

Manuel Sorge, Falk Hüffner, Christian Komusiewicz

Publication date: 20 February 2015

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

Full work available at URL: https://doi.org/10.1007/978-3-662-46078-8_21

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Connectivity (05C40) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (8)

A survey of parameterized algorithms and the complexity of edge modification ⋮ Multivariate algorithmics for finding cohesive subnetworks ⋮ The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs ⋮ Turing kernelization for finding long paths in graph classes excluding a topological minor ⋮ Turing kernelization for finding long paths and cycles in restricted graph classes ⋮ Highly Bi-Connected Subgraphs for Computational Protein Function Annotation ⋮ Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters ⋮ Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor

This page was built for publication: Finding Highly Connected Subgraphs