Complexity of finding dense subgraphs (Q1613384): Difference between revisions
From MaRDI portal
Latest revision as of 15:22, 4 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Complexity of finding dense subgraphs |
scientific article |
Statements
Complexity of finding dense subgraphs (English)
0 references
29 August 2002
0 references
regular graph
0 references
dense subgraph problem
0 references