Pages that link to "Item:Q839051"
From MaRDI portal
The following pages link to Erratum: An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments (Q839051):
Displayed 2 items.
The following pages link to Erratum: An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments (Q839051):
Displayed 2 items.