Pages that link to "Item:Q2235249"
From MaRDI portal
The following pages link to Finding densest \(k\)-connected subgraphs (Q2235249):
Displaying 13 items.
- Finding maximum subgraphs with relatively large vertex connectivity (Q297249) (← links)
- Constructing the highest degree subgraph for dense graphs is in \({\mathcal N}{\mathcal C}{\mathcal A}{\mathcal S}\) (Q1351969) (← links)
- Top-\(k\) overlapping densest subgraphs (Q1741274) (← links)
- The densest subgraph problem with a convex/concave size function (Q1799206) (← links)
- Computing the \(k\) densest subgraphs of a graph (Q2094387) (← links)
- Finding lasting dense subgraphs (Q2218373) (← links)
- Finding connected \(k\)-subgraphs with high density (Q2407097) (← links)
- Finding dense subgraphs with maximum weighted triangle density (Q2666852) (← links)
- Finding Connected Dense $$k$$-Subgraphs (Q2948471) (← links)
- Sandwiching a densest subgraph by consecutive cores (Q3192385) (← links)
- Greedily finding a dense subgraph (Q5054810) (← links)
- LATIN 2004: Theoretical Informatics (Q5901641) (← links)
- Identifying well-connected communities in real-world and synthetic networks (Q6621382) (← links)