Pages that link to "Item:Q1736776"

The following pages link to Multivariate algorithmics for finding cohesive subnetworks (Q1736776):

Displaying 16 items.

• Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: theory and experiments (Q1719617) (← links)
• Dense subgraphs in random graphs (Q1741497) (← links)
• Top-\(k\) overlapping densest subgraphs: approximation algorithms and computational complexity (Q2025099) (← links)
• Hardness and tractability of the \(\gamma\)\textsf{-Complete Subgraph} problem (Q2032141) (← links)
• Computing the \(k\) densest subgraphs of a graph (Q2094387) (← links)
• The parameterized complexity of \(s\)-club with triangle and seed constraints (Q2169965) (← links)
• On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs (Q2242194) (← links)
• A GPU based local search algorithm for the unweighted and weighted maximum \(s\)-plex problems (Q2288976) (← links)
• On the tractability of finding disjoint clubs in a network (Q2422030) (← links)
• Dense Subgraphs in Biological Networks (Q3297795) (← links)
• Covering a Graph with Clubs (Q5377354) (← links)
• On the tractability of covering a graph with 2-clubs (Q5925691) (← links)
• The parameterized complexity of \(s\)-club with triangle and seed constraints (Q6056631) (← links)
• (Q6065417) (← links)
• Computing dense and sparse subgraphs of weakly closed graphs (Q6107896) (← links)
• On the parameterized complexity of s-club cluster deletion problems (Q6165557) (← links)