4   Artículos

 
en línea
Marcus R. Garvie and John Burkardt    
The general problem of tiling finite regions of the plane with polyominoes is ???? NP -complete, and so the associated computational geometry problem rapidly becomes intractable for large instances. Thus, the need to reduce algorithm complexity for tilin... ver más
Revista: Algorithms    Formato: Electrónico

 
en línea
Douglas Lenseth and Boris Goldfarb    
We address the basic question in discrete Morse theory of combining discrete gradient fields that are partially defined on subsets of the given complex. This is a well-posed question when the discrete gradient field V is generated using a fixed algorithm... ver más
Revista: Algorithms    Formato: Electrónico

« Anterior     Página: 1 de 1     Siguiente »