Approximation algorithm for extracting densest subgraph over matching-like constraints (Q6883352)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8137438
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithm for extracting densest subgraph over matching-like constraints |
scientific article; zbMATH DE number 8137438 |
Statements
Approximation algorithm for extracting densest subgraph over matching-like constraints (English)
0 references
16 December 2025
0 references
approximation algorithms
0 references
densest subgraph
0 references
matching-like constraints
0 references
minimum cut
0 references
pipage rounding
0 references
0 references
0 references
0 references
0 references
0 references
