Filters
total: 3165
-
Catalog
- Publications 2367 available results
- Journals 296 available results
- Conferences 82 available results
- People 96 available results
- Inventions 1 available results
- Projects 7 available results
- Laboratories 2 available results
- Research Equipment 1 available results
- e-Learning Courses 85 available results
- Events 14 available results
- Open Research Data 214 available results
displaying 1000 best results Help
Search results for: THORNY GRAPHS
-
Journal of Literary Theory
Journals -
Language and Sociocultural Theory
Journals -
Grounded Theory Review
Journals -
Business: Theory and Practice
Journals -
Theory and Research in Education
Journals -
Theory of Stochastic Processes
Journals -
Educational Practice & Theory
Journals -
Research in Number Theory
Journals -
ALGEBRAS AND REPRESENTATION THEORY
Journals -
Administration Theory and Praxis
Journals -
Theory and Practice of Legislation
Journals -
Planning Theory & Practice
Journals -
Algebra & Number Theory
Journals -
Transnational Legal Theory
Journals -
Control Theory and Technology
Journals -
Advanced Theory and Simulations
Journals -
Music Theory Online
Journals -
Medicine Anthropology Theory
Journals -
JOURNAL OF OPERATOR THEORY
Journals -
JOURNAL OF LIE THEORY
Journals -
JOURNAL OF NUMBER THEORY
Journals -
Finance: Theory and Practice
Journals -
JOURNAL OF APPROXIMATION THEORY
Journals -
JOURNAL OF GROUP THEORY
Journals -
JOURNAL OF ECONOMIC THEORY
Journals -
Bioarchaeology and Social Theory
Journals -
Bible and Critical Theory
Journals -
International Political Theory
Journals -
Analysis in Theory and Applications
Journals -
Journal of K-Theory
Journals -
Chaos Theory and Applications
Journals -
MACROMOLECULAR THEORY AND SIMULATIONS
Journals -
Economic Theory Bulletin
Journals -
MECHANISM AND MACHINE THEORY
Journals -
SOCIOLOGICAL THEORY AND METHODS
Journals -
THEORY OF COMPUTING SYSTEMS
Journals -
Theory, Culture & Society
Journals -
Southeastern International Conference on Combinatorics, Graph Theory, and Computing
Conferences -
Kyoto International Conference on Computational Geometry and Graph Theory
Conferences -
Polyhedral Ramsey Numbers
PublicationGiven two polygons or polyhedrons P1 and P2, we can transform these figures to graphs G1 and G2, respectively. The polyhedral Ramsey number Rp(G1,G2) is the smallest integer n such that every graph, which represents polyhedron on n vertices either contains a copy of G1 or its complement contains a copy of G2. Using a computer search together with some theoretical results we have established some polyhedral Ramsey numbers, for example...
-
Aleksander Orłowski dr hab. inż.
PeopleDr hab. inż. Aleksander Orłowski, profesor PG w Katedrze Zarządzania Wydziału Zarządzania i Ekonomii Politechniki Gdańskiej, v-ce prezes Forum Rozwoju Aglomeracji Gdańskiej. Zawodowo zajmuje się badaniem i rozwojem koncepcji Smart Cities, współautor (2016-2017) badań gotowości do Smart City dziesięciu czołowych polskich urzędów miejskich, autor książki: Model gotowości procesowej urzędu miejskiego dojścia do Smart City (2019)....
-
Bounds on the Cover Time of Parallel Rotor Walks
PublicationThe rotor-router mechanism was introduced as a deterministic alternative to the random walk in undirected graphs. In this model, a set of k identical walkers is deployed in parallel, starting from a chosen subset of nodes, and moving around the graph in synchronous steps. During the process, each node maintains a cyclic ordering of its outgoing arcs, and successively propagates walkers which visit it along its outgoing arcs in...
-
Wojciech Wojnowski dr inż.
PeopleUkończył V Liceum Ogólnokształcące w Gdańsku w klasie o profilu matematyczno-fizycznym z wykładowym językiem angielskim. W 2009 roku rozpoczął studia na Wydziale Chemicznym PG na kierunku technologia chemiczna, uzyskując w 2012 roku tytuł inżyniera, a w 2013 tytuł magistra. W latach 2013–2015 studiował sinologię na Uniwersytecie w Nankinie dzięki uzyskaniu Stypendium Rządu ChRL. Po powrocie do Polski w 2015 roku rozpoczął studia...
-
Global defensive secure structures
PublicationLet 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...
-
Kolorowanie grafów z ograniczeniami na liczbę wierzchołków w określonym kolorze = Graph coloring model with restrictions on cardinalities of vertexes in particular color
PublicationW artykule rozważamy problem takiego kolorowania grafów, w którym klasy kolorów mają ograniczoną z góry moc. Zagadnie to znajduje ciekawe zastosowania praktyczne i jest naturalnym uogólnieniem problemu kolorowania grafów. W artykule ustalamy złożoność obliczeniową dla grafów pełnych $r$-dzielnych i dla kilku innych prostych klas grafów oraz dla problemu dwukolorowania.
-
Morse decompositions for a two-dimensional discrete neuron model (low resolution)
Open Research DataThis dataset contains selected results of rigorous numerical computations conducted in the framework of the research described in the paper “Topological-numerical analysis of a two-dimensional discrete neuron model” by Paweł Pilarczyk, Justyna Signerska-Rynkowska and Grzegorz Graff. A preprint of this paper is available at https://doi.org/10.48550/arXiv.2209.03443.
-
Morse decompositions for a two-dimensional discrete neuron model (limited range)
Open Research DataThis dataset contains selected results of rigorous numerical computations conducted in the framework of the research described in the paper “Topological-numerical analysis of a two-dimensional discrete neuron model” by Paweł Pilarczyk, Justyna Signerska-Rynkowska and Grzegorz Graff. A preprint of this paper is available at https://doi.org/10.48550/arXiv.2209.03443.
-
Morse decompositions for a two-dimensional discrete neuron model (full range)
Open Research DataThis dataset contains selected results of rigorous numerical computations conducted in the framework of the research described in the paper “Topological-numerical analysis of a two-dimensional discrete neuron model” by Paweł Pilarczyk, Justyna Signerska-Rynkowska and Grzegorz Graff. A preprint of this paper is available at https://doi.org/10.48550/arXiv.2209.03443.
-
Bounds on the cover time of parallel rotor walks
PublicationThe rotor-router mechanism was introduced as a deterministic alternative to the random walk in undirected graphs. In this model, a set of k identical walkers is deployed in parallel, starting from a chosen subset of nodes, and moving around the graph in synchronous steps. During the process, each node successively propagates walkers visiting it along its outgoing arcs in round-robin fashion, according to a fixed ordering. We consider...
-
Spaces in Theory
Journals