ISSN:
1689-6300
Publisher:
Uniwersytet Kazimierza Wielkiego w Bydgoszczy
Ministry points: Help
Year | Points | List |
---|---|---|
Year 2024 | 5 | Journal not listed on ministry scored journal list 2024 |
Year | Points | List |
---|---|---|
2024 | 5 | Journal not listed on ministry scored journal list 2024 |
2023 | 5 | Not listed on the ministry scored journals list 2023 |
2022 | 5 | Not listed on the ministry scored journals list (2019-2022) |
2021 | 5 | Not listed on the ministry scored journals list (2019-2022) |
2020 | 5 | Not listed on the ministry scored journals list (2019-2022) |
2019 | 5 | Not listed on the ministry scored journals list (2019-2022) |
2018 | 3 | B |
2017 | 3 | B |
2014 | 3 | B |
2013 | 3 | B |
Model:
Open Access
Impact Factor:
n/a
Publishing policy:
License:
CC BY-SA 3.0
- License
- open in new tab
- Information on publishing policy
- http://www.simis.ukw.edu.pl/?dla-autorow,6 open in new tab
- Information on the conditions of self-archiving
- Included in license
- Is self-archiving allowed by the journal?
- Yes - without restrictions
- Information on research data policy
- n/a
- Months of embargo
- no embargo
- Additional information
-
Must link to journal homepage with DOI.
The Authors retain copyright to their work.
Papers published in journal
Filters
total: 1
Catalog Journals
Year 2014
-
Algorithms for testing security in graphs
PublicationIn 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...
seen 457 times