scientific article
From MaRDI portal
Publication:2753729
zbMath0976.05062MaRDI QIDQ2753729
Publication date: 11 November 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items
Chromatic kernel and its applications ⋮ Parallel Maximum Clique Algorithms with Applications to Network Analysis ⋮ The Densest $k$-Subhypergraph Problem ⋮ Fast approximation for computing the fractional arboricity and extraction of communities of a graph ⋮ Algorithms for the Densest Subgraph with at Least k Vertices and with a Specified Subset ⋮ Test dense subgraphs in sparse uniform hypergraph ⋮ Finding dense subgraphs with maximum weighted triangle density ⋮ Efficient Primal-Dual Graph Algorithms for MapReduce ⋮ Extracting brain disease‐related connectome subgraphs by adaptive dense subgraph discovery ⋮ A unified view of graph regularity via matrix decompositions ⋮ In search of dense subgraphs: How good is greedy peeling? ⋮ Face recognition from caption-based supervision ⋮ On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition ⋮ Covering a graph with densest subgraphs ⋮ Extracting densest sub-hypergraph with convex edge-weight functions ⋮ A study on modularity density maximization: column generation acceleration and computational complexity analysis ⋮ On size-constrained minimum \(s\mathrm{-}t\) cut problems and size-constrained dense subgraph problems ⋮ Auditing for core stability in participatory budgeting ⋮ Mediation analysis for high-dimensional mediators and outcomes with an application to multimodal imaging data ⋮ An efficient query recovery attack against a graph encryption scheme ⋮ On integer linear programs for treewidth based on perfect elimination orderings ⋮ OCSM: finding overlapping cohesive subgraphs with minimum degree ⋮ Discovering subjectively interesting multigraph patterns ⋮ Fair-by-design matching ⋮ Efficient and effective community search ⋮ Finding lasting dense subgraphs ⋮ Dense Subgraphs in Biological Networks ⋮ Finding densest \(k\)-connected subgraphs ⋮ Phase transition of the 2-choices dynamics on core-periphery networks ⋮ Top-\(k\) overlapping densest subgraphs ⋮ Maximal strongly connected cliques in directed graphs: algorithms and bounds ⋮ In search of the densest subgraph ⋮ Randomized priority algorithms ⋮ Modularity-maximizing graph communities via mathematical programming ⋮ Dense and sparse graph partition ⋮ Regularity lemmas for clustering graphs ⋮ The complexity of detecting fixed-density clusters ⋮ Top-\(k\) overlapping densest subgraphs: approximation algorithms and computational complexity ⋮ Mining communities and their descriptions on attributed graphs: a survey ⋮ The densest subgraph problem with a convex/concave size function ⋮ Finding a Dense-Core in Jellyfish Graphs ⋮ Density decompositions of networks ⋮ Unnamed Item ⋮ Finding weighted \(k\)-truss communities in large networks ⋮ Contention resolution, matrix scaling and fair allocation ⋮ Computing the \(k\) densest subgraphs of a graph ⋮ Clustering as an Approach to 3D Reconstruction Problem
