A new global algorithm for max-cut problem with chordal sparsity (Q6103705): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s10957-023-02195-3 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10957-023-02195-3 / rank | |||
Normal rank | |||
Latest revision as of 18:29, 30 December 2024
scientific article; zbMATH DE number 7702984
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new global algorithm for max-cut problem with chordal sparsity |
scientific article; zbMATH DE number 7702984 |
Statements
A new global algorithm for max-cut problem with chordal sparsity (English)
0 references
27 June 2023
0 references
max-cut
0 references
branch-and-bound
0 references
sparsity pattern
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
