Efficient branch-and-bound algorithms for finding triangle-constrained 2-clubs (Q6646734)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Efficient branch-and-bound algorithms for finding triangle-constrained 2-clubs |
scientific article; zbMATH DE number 7952404
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient branch-and-bound algorithms for finding triangle-constrained 2-clubs |
scientific article; zbMATH DE number 7952404 |
Statements
Efficient branch-and-bound algorithms for finding triangle-constrained 2-clubs (English)
0 references
3 December 2024
0 references
clique relaxation
0 references
branch and bound
0 references
NP-hard problem
0 references
data reduction rules
0 references
0 references
0 references
