A polynomial algorithm for constructing families of k-independent sets

DOI10.1016/0012-365X(88)90088-XzbMath0709.05003MaRDI QIDQ920998

Elsie Sterbin Gottlieb

Publication date: 1988

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

zbMATH Keywords

algorithmpolynomial complexityconstructing families of k-independent subsets

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Permutations, words, matrices (05A05)

Related Items (3)

Explicit constructions of centrally symmetric \(k\)-neighborly polytopes and large strictly antipodal sets ⋮ Asymptotic and constructive methods for covering perfect hash families and covering arrays ⋮ Exhaustive testing of almost all devices with outputs depending on limited number of inputs

Cites Work

• Explicit construction of exponential sized families of k-independent sets
• Families of \(k\)-independent sets
• Iterative Exhaustive Pattern Generation for Logic Testing

This page was built for publication: A polynomial algorithm for constructing families of k-independent sets