E l e c t r o n i c j o u r n

HIGHLIGHTS

• who: Electr and collaborators from the Institut für Informatik, Germany have published the research: E l e c t r o n i c J o u r n, in the Journal: (JOURNAL)
• what: The authors show that under some restrictive assumptions a polynomial time algorithm can be devised which generalizes an important result of Provan and Ball network reliability.

SUMMARY

Inclusion-exclusion identities and inequalities play an important role in many areas of mathematics. For any finite collection of sets {Av }v∈V and any n ∈ N0=N ∪ {0 . . .

 



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.