A polyhedral study of the maximum edge subgraph problem (Q5891092): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Greedily Finding a Dense Subgraph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Complexity of finding dense subgraphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Different Formulations for Solving the Heaviest<i>K</i>-Subgraph Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The dense \(k\)-subgraph problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A deterministic approximation algorithm for the densest \(k\)-subgraph problem / rank | |||
Normal rank | |||
Latest revision as of 15:18, 6 July 2024
scientific article; zbMATH DE number 6189813
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polyhedral study of the maximum edge subgraph problem |
scientific article; zbMATH DE number 6189813 |
Statements
A polyhedral study of the maximum edge subgraph problem (English)
0 references
19 July 2013
0 references
polyhedral combinatorics
0 references
maximum edge subgraph problem
0 references
