Tomasz Gieniusz - Publications - Bridge of Knowledge

Search

Filters

total: 1

  • Category
  • Year

clear Chosen catalog filters disabled

Catalog Publications

Year 2015
  • Graph security testing

    Set S ⊂ V is called secure set iff ∀ X ⊂ S | N [ X ] ∩ S | ≥ | N ( X ) \ S | [3]. That means that every subset of a secure set has at least as many friends (neighbour vertices in S) as enemies (neighbour vertices outside S) and will be defended in case of attack. Problem of determining if given set is secure is co −NP -complete, there is no efficient algorithm solving it [3]. Property testers are algorithms that distinguish inputs...

    Full text to download in external service

seen 369 times