Affordable Access

Publisher Website

Algorithms to Find Directed Packings

DOI: 10.1016/s0304-0208(08)72977-3
  • Computer Science
  • Mathematics


Abstract We discuss computational methods to find (t,v,v) directed packings, i.e. sets of permutations of v symbols such that no t symbols appear in the same order in more than one of the permutations. In so doing, we give algorithms for finding all n-cliques in a given n-partite graph, and in an arbitrary graph. We also discuss an algebraic method for finding directed packings.

There are no comments yet on this publication. Be the first to share your thoughts.