Finding densest $k$-connected subgraphs (Q2235249): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W3039988939
@@ Property / OpenAlex ID: W3039988939 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.01533
@@ Property / arXiv ID: 2007.01533 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding Dense Subgraphs with Size Bounds
@@ Property / cites work: Finding Dense Subgraphs with Size Bounds / rank @@
+Normal rank
@@ Property / cites work @@
+On the number of edges in a graph with no \((k + 1)\)-connected subgraphs
+Normal rank
@@ Property / cites work @@
+Detecting high log-densities
@@ Property / cites work: Detecting high log-densities / rank @@
+Normal rank
@@ Property / cites work @@
+Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams
+Normal rank
@@ Property / cites work @@
+Q2753729
@@ Property / cites work: Q2753729 / rank @@
+Normal rank
@@ Property / cites work @@
+Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs
+Normal rank
@@ Property / cites work @@
+An $o(n^3 )$-Time Maximum-Flow Algorithm
@@ Property / cites work: An $o(n^3 )$-Time Maximum-Flow Algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+The dense \(k\)-subgraph problem
@@ Property / cites work: The dense \(k\)-subgraph problem / rank @@
+Normal rank
@@ Property / cites work @@
+Computing and Testing Small Connectivity in Near-Linear Time and Queries via Fast Local Cut Algorithms
+Normal rank
@@ Property / cites work @@
+Using expander graphs to find vertex connectivity
@@ Property / cites work: Using expander graphs to find vertex connectivity / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time
+Normal rank
@@ Property / cites work @@
+Computing Vertex Connectivity: New Bounds from Old Techniques
+Normal rank
@@ Property / cites work @@
+Local Flow Partitioning for Faster Edge Connectivity
+Normal rank
@@ Property / cites work @@
+Dividing a Graph into Triconnected Components
@@ Property / cites work: Dividing a Graph into Triconnected Components / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum cuts in near-linear time
@@ Property / cites work: Minimum cuts in near-linear time / rank @@
+Normal rank
@@ Property / cites work @@
+Deterministic Edge Connectivity in Near-Linear Time
+Normal rank
@@ Property / cites work @@
+The densest subgraph problem with a convex/concave size function
+Normal rank
@@ Property / cites work @@
+On Finding Dense Subgraphs
@@ Property / cites work: On Finding Dense Subgraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Rubber bands, convex embeddings and graph connectivity
+Normal rank
@@ Property / cites work @@
+Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte
+Normal rank
@@ Property / cites work @@
+Q4189309
@@ Property / cites work: Q4189309 / rank @@
+Normal rank
@@ Property / cites work @@
+An algorithm for finding all the<i>k</i>-components of a digraph
+Normal rank
@@ Property / cites work @@
+k-Blocks and Ultrablocks in Graphs
@@ Property / cites work: k-Blocks and Ultrablocks in Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
+Normal rank
@@ Property / cites work @@
+Breaking quadratic time for small vertex connectivity and an approximation scheme
+Normal rank
@@ Property / cites work @@
+A simple min-cut algorithm
@@ Property / cites work: A simple min-cut algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Depth-First Search and Linear Graph Algorithms
@@ Property / cites work: Depth-First Search and Linear Graph Algorithms / rank @@
+Normal rank

Finding densest \(k\)-connected subgraphs (Q2235249): Difference between revisions

Latest revision as of 20:39, 26 July 2024

Statements

Identifiers

Sitelinks

Mathematics(1 entry)