Nie znaleźliśmy wyników w zadanych kryteriach!
Ale mamy wyniki w innych katalogach.Filtry
wszystkich: 1196
-
Katalog
- Publikacje 900 wyników po odfiltrowaniu
- Czasopisma 161 wyników po odfiltrowaniu
- Konferencje 7 wyników po odfiltrowaniu
- Wydawnictwa 1 wyników po odfiltrowaniu
- Osoby 36 wyników po odfiltrowaniu
- Projekty 5 wyników po odfiltrowaniu
- Kursy Online 24 wyników po odfiltrowaniu
- Wydarzenia 8 wyników po odfiltrowaniu
- Dane Badawcze 54 wyników po odfiltrowaniu
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: GLOBAL ALLIANCE, GLOBAL EDGE ALLIANCE, GLOBAL COMPLETE ALLIANCE
-
Tight bounds on global edge and complete alliances in trees
PublikacjaIn 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...
-
Global edge alliances in graphs
PublikacjaIn 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...
-
Global defensive secure structures
PublikacjaLet 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...
-
Strategic balance in graphs
PublikacjaFor a given graph G, a nonempty subset S contained in V ( G ) is an alliance iff for each vertex v ∈ S there are at least as many vertices from the closed neighbourhood of v in S as in V ( G ) − S. An alliance is global if it is also a dominating set of G. The alliance partition number of G was defined in Hedetniemi et al. (2004) to be the maximum number of sets in a partition of V ( G ) such that each set is an alliance. Similarly,...
-
Justyna Szostak dr inż.
OsobyI Gdańsk University of Technology: Chair of the Rector’s Internationalization Committee (October 2020 - Present) Erasmus + Coordinator for students and staff members, Faculty of Applied Physics and Mathematics (Mar 2017 - Present) Dean's Proxy for Internationalization, Faculty of Applied Physics and Mathematics (October 2020 - Present) Coordinator of the International Relations Office of the Faculty of Applied Physics and...
-
Global defensive sets in graphs
PublikacjaIn the paper we study a new problem of finding a minimum global defensive set in a graph which is a generalization of the global alliance problem. For a given graph G and a subset S of a vertex set of G, we define for every subset X of S the predicate SEC ( X ) = true if and only if | N [ X ] ∩ S | ≥ | N [ X ] \ S | holds, where N [ X ] is a closed neighbourhood of X in graph G. A set S is a defensive alliance if and only if for...
-
Life Science Alliance
Czasopisma -
Aleksandra Parteka dr hab. inż.
OsobyAbout me: I am an associate professor and head of doctoral studies at the Faculty of Management and Economics, Gdansk University of Technology (GdanskTech, Poland). I got my MSc degree in Economics from Gdansk University of Technology (2003) and Universita’ Politecnica delle Marche (2005), as well as MA degree in Contemporary European Studies from Sussex University (2006, with distinction). I received my PhD in Economics...
-
The unrestricted global effort to complete the COOL trial
Publikacja -
Space and Landscape in a Global Context
Kursy OnlineModule SPACE AND LANDSCAPE IN A GLOBAL CONTEXT (2022/2023, autumn semester) Objective The objective of the module is to debate different approaches to managing spatial development and contemporary issues in a global context. The course is founded on the students' knowledge about urban planning and instruments used to make them better places both for people and the environment. Course proceedings Lectures and classes run online...