Pages that link to "Item:Q1758028"

The following pages link to Parameterized computational complexity of finding small-diameter subgraphs (Q1758028):

Displaying 29 items.

• Algorithms for the maximum \(k\)-club problem in graphs (Q385488) (← links)
• Finding clubs in graph classes (Q400518) (← links)
• Finding large \(k\)-clubs in undirected graphs (Q488393) (← links)
• Turing kernelization for finding long paths and cycles in restricted graph classes (Q730497) (← links)
• Finding a maximum \(k\)-club using the \(k\)-clique formulation and canonical hypercube cuts (Q1634801) (← links)
• Optimal approximation algorithms for maximum distance-bounded subgraph problems (Q1635712) (← links)
• Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights (Q1640044) (← links)
• Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: theory and experiments (Q1719617) (← links)
• Multivariate algorithmics for finding cohesive subnetworks (Q1736776) (← links)
• Hardness and tractability of the \(\gamma\)\textsf{-Complete Subgraph} problem (Q2032141) (← links)
• On some FPT problems without polynomial Turing compressions (Q2072079) (← links)
• Algorithms and complexity of \(s\)-club cluster vertex deletion (Q2115849) (← links)
• The parameterized complexity of \(s\)-club with triangle and seed constraints (Q2169965) (← links)
• Subexponential algorithm for \(d\)-cluster edge deletion: exception or rule? (Q2186825) (← links)
• Turing kernelization for finding long paths in graph classes excluding a topological minor (Q2272596) (← links)
• On structural parameterizations for the 2-club problem (Q2341718) (← links)
• An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems (Q2354725) (← links)
• On the tractability of finding disjoint clubs in a network (Q2422030) (← links)
• Finding disjoint dense clubs in a social network (Q2636493) (← links)
• On 2-clubs in graph-based data clustering: theory and algorithm engineering (Q2692726) (← links)
• Distance-Based Clique Relaxations in Networks: s-Clique and s-Club (Q2820114) (← links)
• On the 2-Club Polytope of Graphs (Q2957469) (← links)
• Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems (Q3467873) (← links)
• On Fault-Tolerant Low-Diameter Clusters in Graphs (Q5060794) (← links)
• On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering (Q5084692) (← links)
• Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor (Q5111882) (← links)
• Covering a Graph with Clubs (Q5377354) (← links)
• The parameterized complexity of \(s\)-club with triangle and seed constraints (Q6056631) (← links)
• Computing dense and sparse subgraphs of weakly closed graphs (Q6107896) (← links)