Pregled bibliografske jedinice broj: 483798
Exhaustive combinatorial enumeration
Exhaustive combinatorial enumeration // Colloquium of mathematical department, National university of Galway, Ireland
Galway, Irska, 2007. (plenarno, međunarodna recenzija, pp prezentacija, znanstveni)
CROSBI ID: 483798 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
Exhaustive combinatorial enumeration
Autori
Dutour Sikirić, Mathieu
Vrsta, podvrsta i kategorija rada
Sažeci sa skupova, pp prezentacija, znanstveni
Izvornik
Colloquium of mathematical department, National university of Galway, Ireland
/ - , 2007
Skup
Colloquium of mathematical department, National university of Galway, Ireland
Mjesto i datum
Galway, Irska, 03.09.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
