Pages that link to "Item:Q3601165"

The following pages link to Finding Dense Subgraphs with Size Bounds (Q3601165):

Displaying 32 items.

• Parameterized complexity of finding small degree-constrained subgraphs (Q414424) (← links)
• On set expansion problems and the small set expansion conjecture (Q494429) (← links)
• Isolation concepts for efficiently enumerating dense subgraphs (Q837155) (← links)
• On size-constrained minimum \(s\mathrm{-}t\) cut problems and size-constrained dense subgraph problems (Q897915) (← links)
• Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem (Q1683124) (← links)
• Top-\(k\) overlapping densest subgraphs (Q1741274) (← links)
• The densest subgraph problem with a convex/concave size function (Q1799206) (← links)
• Almost-spanning subgraphs with bounded degree in dense graphs (Q1864574) (← links)
• Top-\(k\) overlapping densest subgraphs: approximation algorithms and computational complexity (Q2025099) (← links)
• Homophily outlier detection in non-IID categorical data (Q2036755) (← links)
• Computing the \(k\) densest subgraphs of a graph (Q2094387) (← links)
• Discovering subjectively interesting multigraph patterns (Q2203340) (← links)
• Finding densest \(k\)-connected subgraphs (Q2235249) (← links)
• Proportionally dense subgraph of maximum size: complexity and approximation (Q2334039) (← links)
• Finding connected \(k\)-subgraphs with high density (Q2407097) (← links)
• Exact algorithms for problems related to the densest \(k\)-set problem (Q2448865) (← links)
• Threshold-based preprocessing for approximating the weighted dense \(k\)-subgraph problem (Q2514764) (← links)
• Inapproximability of maximum biclique problems, minimum \( k\)-cut and densest at-least-\( k\)-subgraph from the small set expansion hypothesis (Q2633244) (← links)
• Finding dense subgraphs with maximum weighted triangle density (Q2666852) (← links)
• Detecting and Characterizing Small Dense Bipartite-Like Subgraphs by the Bipartiteness Ratio Measure (Q2872130) (← links)
• Finding Connected Dense $$k$$-Subgraphs (Q2948471) (← links)
• Sandwiching a densest subgraph by consecutive cores (Q3192385) (← links)
• Algorithms for the Densest Subgraph with at Least k Vertices and with a Specified Subset (Q3467871) (← links)
• Dense subgraph problems with output-density conditions (Q4962748) (← links)
• Greedily finding a dense subgraph (Q5054810) (← links)
• Test dense subgraphs in sparse uniform hypergraph (Q5079097) (← links)
• Sparse Graphs Are Near-Bipartite (Q5130577) (← links)
• On solving the densest<i>k</i>-subgraph problem on large graphs (Q5859000) (← links)
• (Q6065417) (← links)
• In search of dense subgraphs: How good is greedy peeling? (Q6087137) (← links)
• An Escape Time Formulation for Subgraph Detection and Partitioning of Directed Graphs (Q6130647) (← links)
• Covering a graph with densest subgraphs (Q6659505) (← links)