Search
ISSN:
eISSN:
Disciplines
(Field of Science):
- information and communication technology (Engineering and Technology)
- biomedical engineering (Engineering and Technology)
- mechanical engineering (Engineering and Technology)
- management and quality studies (Social studies)
- computer and information sciences (Natural sciences)
(Field of Science)
Ministry points: Help
| Year | Points | List |
|---|---|---|
| Year 2024 | 70 | Ministry scored journals list 2024 |
| Year | Points | List |
|---|---|---|
| 2024 | 70 | Ministry scored journals list 2024 |
| 2023 | 70 | Ministry Scored Journals List |
| 2022 | 70 | Ministry Scored Journals List 2019-2022 |
| 2021 | 70 | Ministry Scored Journals List 2019-2022 |
| 2020 | 70 | Ministry Scored Journals List 2019-2022 |
| 2019 | 70 | Ministry Scored Journals List 2019-2022 |
| 2018 | 20 | A |
| 2017 | 20 | A |
| 2016 | 15 | A |
| 2015 | 15 | A |
| 2014 | 15 | A |
| 2013 | 20 | A |
| 2012 | 20 | A |
| 2011 | 20 | A |
| 2010 | 20 | A |
Model:
Points CiteScore:
| Year | Points |
|---|---|
| Year 2023 | 1.8 |
| Year | Points |
|---|---|
| 2023 | 1.8 |
| 2022 | 2 |
| 2021 | 2.6 |
| 2020 | 2.3 |
| 2019 | 2.3 |
| 2018 | 2.2 |
| 2017 | 1.9 |
| 2016 | 1.8 |
| 2015 | 1.7 |
| 2014 | 1.7 |
| 2013 | 1.7 |
| 2012 | 1.5 |
| 2011 | 1.5 |
Impact Factor:
Sherpa Romeo:
Papers published in journal
Filters
total: 8
Catalog Journals
Year 2016
-
On the hardness of computing span of subcubic graphs
PublicationIn the paper we study the problem of finding ξ-colorings with minimal span, i.e. the difference between the largest and the smallest color used.
Year 2015
-
The computational complexity of the backbone coloring problem for bounded-degree graphs with connected backbones
PublicationGiven a graph G, a spanning subgraph H of G and an integer λ>=2, a λ-backbone coloring of G with backbone H is a vertex coloring of G using colors 1, 2, ..., in which the color difference between vertices adjacent in H is greater than or equal to lambda. The backbone coloring problem is to find such a coloring with maximum color that does not exceed a given limit k. In this paper, we study the backbone coloring problem for bounded-degree...
Year 2013
-
Trees having many minimal dominating sets
PublicationWe provide an algorithm for listing all minimal dominating sets of a tree of order n in time O(1.4656^n). This leads to that every tree has at most 1.4656^n minimal dominating sets. We also give an infinite family of trees of odd and even order for which the number of minimal dominating sets exceeds 1.4167^n, thus exceeding 2^{n/2}. This establishes a lower bound on the running time of an algorithm for listing all minimal dominating...
Year 2009
-
Maximum vertex occupation time and inert fugitive: recontamination does help [online]
PublicationRozważamy problem przeszukania danego grafu prostego G w celu przechwycenia niewidocznego i leniwego uciekiniera. Parametrem optymalizacyjnym, który minimalizujemy jest maksymalny czas (liczba tur strategii przeszukiwania), podczas których wierzchołek może być strzeżony (okupowany przez strażnika). Strategia monotoniczna to taka, która nie dopuszcza sytuacji, w której uciekinier dociera do wierzchołka, który wcześniej został oczyszczony....
Year 2008
-
A note on mixed tree coloring
PublicationZaproponowano liniowy algorytm dla problemu kolorowania mieszanego w drzewach, uzyskując tym samym poprawę w stosunku do algorytmu o złożoności O(n^2) podanego w pracy [P. Hansen, J. Kuplinsky, D. de Werra, Mixed graph colorings, Math. Methods Oper. Res. 45 (1997) 145-160].
Year 2006
-
An approximation algorithm for maximum P3-packing in subcubic graphs
PublicationW pracy podano algorytm 4/3-przyliżony dla trudnego obliczeniowo problemu umieszczania wierzchołkowo rozłącznych dwukrawędziowych ścieżek w grafach o stopniu maksymalnym 3 i stopniu minimalnym 2. Poprawiono tym samym wcześniejsze wyniki dla grafów kubicznych (A. Kelmans, D. Mubayi, Journal of Graph Theory 45, 2004).
Year 2002
-
Complexity of weak acceptonic conditions in tree automata
PublicationRozważano złożoność problemu pustości dla automatów na drzewach ze słabymi warunkami akceptowalności. Rozważano także translacje pomiędzy słabymi i silnymi warunkami akceptowalności.
Year 2000
seen 650 times