Parallel enumeration of lattice animals

DOI10.1007/978-3-642-21204-8_13MaRDI QIDQ3004659zbMATH OpenOpenAlexWikidataFDO

Authors Gadi Aleksandrowicz, Gill Barequet

Publication date 3 June 2011

Published in Frontiers in Algorithmics and Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-21204-8_13

zbMATH Keywords

leaperspolycubespolyominoessubgraph counting

Mathematics Subject Classification ID

Polyominoes (05B50)

Recommendations

• Counting lattice animals: A parallel attack
• Counting polycubes without the dimensionality curse
• Counting Polycubes without the Dimensionality Curse
• Counting d-Dimensional Polycubes and Nonrectangular Planar Polyominoes
• COUNTING d-DIMENSIONAL POLYCUBES AND NONRECTANGULAR PLANAR POLYOMINOES

Cites work

• 1/d-expansions for the free energy of lattice animal models of a self-interacting branched polymer
• COUNTING d-DIMENSIONAL POLYCUBES AND NONRECTANGULAR PLANAR POLYOMINOES
• Counting lattice animals: A parallel attack
• Counting multidimensional polyominoes
• Counting polycubes without the dimensionality curse
• Counting polyominoes: yet another attack
• Enumerations of lattice animals and trees
• scientific article; zbMATH DE number 3148802 (Why is no real title available?)
• Reverse search for enumeration

Cited in

(6)

• Counting lattice animals: A parallel attack
• The impact of large-scale computing on lattice statistics.
• Algorithms for counting minimum-perimeter lattice animals
• Animal testing
• Lattice animals on a staircase and Fibonacci numbers
• Some problems in the counting of lattice animals, polyominoes, polygons and walks

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: Parallel enumeration of lattice animals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3004659)