Permanent decomposition algorithm for the combinatorial objects generation

HIGHLIGHTS

SUMMARY

[1] At the heart of the approach are procedures for the permanent decomposition of incidence matrices with memorization of identifier elements. Information about which elements are included in the corresponding sets will be given in the form of an incidence matrix:         a1 n11 a2 n12 Sm nm1 nm 2 an   n1n  n2 n  ...   nmn  If the element ai is "stream", then it must be simultaneously written in all positions of the sample vector, where the correspondent incidence matrix column contains non-zero elements. If the running element is streaming, then all rows where the . . .

 



If you want to have access to all the content you need to log in!

Thanks :)

Username or Email

Password

Remember me

Lost your password?

If you don't have an account, you can create one here.