ZIB

Treffer pro Seite

Treffer 1 - 1 | 1 Treffer

Sortierung

Digitale Medien

An exact algorithm for the maximum stable set problem (1994)

Mannino, Carlo ; Sassano, Antonio

Springer

Computational optimization and applications 3 (1994), S. 243-258

zur Merkliste hinzufügen auf der Merkliste

Details

ISSN: 1573-2894

Schlagwort(e): Maximum stable set ; maximum clique ; branch-and-bound

Quelle: Springer Online Journal Archives 1860-2000

Thema: Informatik

Notizen: Abstract We describe a new branch-and-bound algorithm for the exact solution of the maximum cardinality stable set problem. The bounding phase is based on a variation of the standard greedy algorithm for finding a colouring of a graph. Two different node-fixing heuristics are also described. Computational tests on random and structured graphs and very large graphs corresponding to ‘real-life’ problems show that the algorithm is competitive with the fastest algorithms known so far.

Materialart: Digitale Medien

URL: http://dx.doi.org/10.1007/BF01299447

Permalink

Bibliothek	Standort	Signatur	Band/Heft/Jahr	Verfügbarkeit

Andere fanden auch interessant ...

Artikel (Nationallizenzen)

Volltext

Treffer 1 - 1 | 1 Treffer