Tomasz Gieniusz - Science profile - Bridge of Knowledge

Search

Business contact

Centrum Transferu Wiedzy i Technologii
Location
Al. Zwycięstwa 27, 80-219 Gdańsk
Phone
+48 58 348 62 62
E-mail
biznes@pg.edu.pl

Publication showcase

  • 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 390 times