Pages that link to "Item:Q5175112"
From MaRDI portal
The following pages link to Finding Highly Connected Subgraphs (Q5175112):
Displaying 8 items.
- Turing kernelization for finding long paths and cycles in restricted graph classes (Q730497) (← links)
- Multivariate algorithmics for finding cohesive subnetworks (Q1736776) (← links)
- The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs (Q1756342) (← links)
- Turing kernelization for finding long paths in graph classes excluding a topological minor (Q2272596) (← links)
- Highly Bi-Connected Subgraphs for Computational Protein Function Annotation (Q2817900) (← links)
- Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters (Q5111220) (← links)
- Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor (Q5111882) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
