Phorma: perfectly hashable order restricted multidimensional arrays

DOI10.1016/S0166-218X(03)00374-3zbMath1064.05002OpenAlexW1988220805MaRDI QIDQ1827865

Sílvio Melo, Sóstenes Lins, Lauro Lins

Publication date: 6 August 2004

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(03)00374-3

zbMATH Keywords

DigraphImplicit enumerationcombinatorial familyNijenhuis--WilfPerfect hash function

Mathematics Subject Classification ID

Applications of graph theory (05C90) Permutations, words, matrices (05A05) Ordered structures (06F99)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An \(n\)-tet graph approach for non-guillotine packings of \(n\)-dimensional boxes into an \(n\)-container
• An L-approach for packing (ℓ, w)-rectangles into rectangular and L-shaped pieces

This page was built for publication: Phorma: perfectly hashable order restricted multidimensional arrays