Pregled bibliografske jedinice broj: 483446
Combinatorial enumeration on computer
Combinatorial enumeration on computer // ISM symposium, stochastic models and discrete geometry, Institute of statistical mathematics
Tokyo, Japan, 2007. (plenarno, međunarodna recenzija, pp prezentacija, znanstveni)
CROSBI ID: 483446 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
Combinatorial enumeration on computer
Autori
Dutour Sikirić, Mathieu
Vrsta, podvrsta i kategorija rada
Sažeci sa skupova, pp prezentacija, znanstveni
Izvornik
ISM symposium, stochastic models and discrete geometry, Institute of statistical mathematics
/ - , 2007
Skup
ISM symposium, stochastic models and discrete geometry, Institute of statistical mathematics
Mjesto i datum
Tokyo, Japan, 26.02.2007. - 28.02.2007
Vrsta sudjelovanja
Plenarno
Vrsta recenzije
Međunarodna recenzija
Ključne riječi
practical enumeration; backtack; graph isomorphism problem
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 problem. 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
Računarstvo
