Arkadiusz Hiler - Publications - Bridge of Knowledge

Search

Filters

total: 1

  • Category
  • Year
  • Options

clear Chosen catalog filters disabled

Catalog Publications

Year 2014
  • Algorithms for testing security in graphs

    In this paper we propose new algorithmic methods giving with the high probability the correct answer to the decision problem of security in graphs. For a given graph G and a subset S of a vertex set of G we have to decide whether S is secure, i.e. every subset X of S fulfils the condition: |N[X] \cap S| >= |N[X] \ S|, where N[X] is a closed neighbourhood of X in graph G. We constructed a polynomial time property pseudotester based...

    Full text available to download

seen 505 times