Kacper Wereszko - Publikacje - MOST Wiedzy

Wyszukiwarka

Filtry

wszystkich: 11

  • Kategoria
  • Rok
  • Opcje

wyczyść Filtry wybranego katalogu niedostępne

Katalog Publikacji

Rok 2023
Rok 2022
  • Global defensive secure structures
    Publikacja

    Let S ⊂ V (G) for a given simple non-empty graph G. We define for any nonempty subset X of S the predicate SECG,S(X) = true iff |NG[X]∩S| ≥ |NG[X]\S|. Let H be a non-empty family of graphs such that for each vertex v ∈ V (G) there is a subgraph H of G containing v and isomorphic to a member of H. We introduce the concept of H-alliance extending the concept of global defensive secure structures. By an H-alliance in a graph G we...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Greencoin – educational information system for ecoinclusion and empowering urban adaptability.
    Publikacja

    - Rok 2022

    The SARS-CoV19 pandemic exposed a broad spectrum of challenges for modern cities, societies and the environment at large. The post-Covid transformation requires new social, ecological and educational solutions, adjusted to modern challenges, but also equipped with technological advances that allow for digital inclusion and sustainable urban development to benefit the local economy and society. Many information systems designed...

    Pełny tekst do pobrania w portalu

Rok 2021
Rok 2020
  • Tight bounds on global edge and complete alliances in trees

    In the talk the authors present some tight upper bounds on global edge alliance number and global complete alliance number of trees. Moreover, we present our NP-completeness results from [8] for global edge alliances and global complete alliances on subcubic bipartite graphs without pendant vertices. We discuss also polynomial time exact algorithms for finding the minimum global edge alliance on trees [7] and complete alliance...

    Pełny tekst do pobrania w serwisie zewnętrznym

Rok 2019
  • Global edge alliances in graphs

    In the paper we introduce and study a new problem of finding a minimum global edge alliance in a graph which is related to the global defensive alliance (Haynes et al., 2013; Hedetniemi, 2004) and the global defensive set (Lewoń et al., 2016). We proved the NP-completeness of the global edge alliance problem for subcubic graphs and we constructed polynomial time algorithms for trees. We found the exact values of the size of the...

    Pełny tekst do pobrania w portalu

Rok 2018

wyświetlono 1141 razy