Pregled bibliografske jedinice broj: 428966
Exhaustive enumeration techniques
Exhaustive enumeration techniques // Bled'07, 6th international conference on graph theory
Bled, Slovenija, 2007. (plenarno, međunarodna recenzija, pp prezentacija, znanstveni)
CROSBI ID: 428966 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
Exhaustive enumeration techniques
Autori
Dutour Sikirić, Mathieu
Vrsta, podvrsta i kategorija rada
Sažeci sa skupova, pp prezentacija, znanstveni
Izvornik
Bled'07, 6th international conference on graph theory
/ - , 2007
Skup
Bled'07, 6th international conference on graph theory
Mjesto i datum
Bled, Slovenija, 24.06.2007. - 30.06.2007
Vrsta sudjelovanja
Plenarno
Vrsta recenzije
Međunarodna recenzija
Ključne riječi
enumeration; algorithm; backtracking
Sažetak
The task of enumerating combinatorial objects (like graphs, plane graphs, cliques, etc.) can be done by computer. Computers, however fast, have limits and a blind application of them will fail for serious problems. We expose here a few general methods to deal with the complexity of combinatorial enumeration, by using symmetry, partitioning the computation and restricting the search space.
Izvorni jezik
Engleski
Znanstvena područja
Matematika
